java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:49:32,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:49:32,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:49:32,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:49:32,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:49:32,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:49:32,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:49:32,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:49:32,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:49:32,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:49:32,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:49:32,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:49:32,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:49:32,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:49:32,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:49:32,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:49:32,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:49:32,219 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:49:32,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:49:32,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:49:32,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:49:32,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:49:32,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:49:32,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:49:32,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:49:32,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:49:32,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:49:32,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:49:32,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:49:32,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:49:32,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:49:32,233 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:49:32,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:49:32,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:49:32,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:49:32,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:49:32,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:49:32,249 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:49:32,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:49:32,250 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:49:32,250 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:49:32,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:49:32,250 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:49:32,250 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:49:32,251 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:49:32,251 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:49:32,251 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:49:32,251 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:49:32,251 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:49:32,252 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:49:32,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:49:32,253 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:49:32,253 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:49:32,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:49:32,254 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:49:32,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:49:32,254 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:49:32,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:49:32,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:49:32,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:49:32,256 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:49:32,256 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:49:32,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:49:32,257 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:49:32,257 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:49:32,257 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:49:32,257 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:49:32,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:49:32,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:49:32,259 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:49:32,259 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:49:32,259 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:49:32,259 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:49:32,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:49:32,260 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:49:32,260 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:49:32,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:49:32,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:49:32,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:49:32,319 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:49:32,319 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:49:32,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-02-25 15:49:32,320 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-02-25 15:49:32,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:49:32,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:49:32,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:49:32,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:49:32,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:49:32,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,394 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:49:32,394 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:49:32,394 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:49:32,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:49:32,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:49:32,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:49:32,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:49:32,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... [2019-02-25 15:49:32,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:49:32,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:49:32,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:49:32,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:49:32,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-02-25 15:49:32,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-25 15:49:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-25 15:49:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-25 15:49:32,780 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:49:32,781 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-25 15:49:32,782 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:49:32 BoogieIcfgContainer [2019-02-25 15:49:32,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:49:32,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:49:32,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:49:32,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:49:32,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:49:32" (1/2) ... [2019-02-25 15:49:32,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6f59ae and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:49:32, skipping insertion in model container [2019-02-25 15:49:32,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:49:32" (2/2) ... [2019-02-25 15:49:32,791 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-02-25 15:49:32,802 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:49:32,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:49:32,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:49:32,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:49:32,863 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:49:32,863 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:49:32,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:49:32,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:49:32,863 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:49:32,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:49:32,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:49:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:49:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:49:32,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:32,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:49:32,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:32,896 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-25 15:49:32,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:32,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:32,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:33,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:49:33,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:49:33,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:49:33,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:49:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:49:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:49:33,148 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:49:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:33,299 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-25 15:49:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:49:33,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:49:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:33,320 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:49:33,320 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:49:33,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:49:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:49:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-02-25 15:49:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:49:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:49:33,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-02-25 15:49:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:33,358 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:49:33,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:49:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:49:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:49:33,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:33,360 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:49:33,360 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:33,361 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-02-25 15:49:33,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:33,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:33,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:33,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:33,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:33,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:49:33,592 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-02-25 15:49:33,678 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:49:33,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:49:39,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:49:39,511 INFO L272 AbstractInterpreter]: Visited 5 different actions 38 times. Merged at 4 different actions 33 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:49:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:39,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:49:39,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:39,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:39,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:39,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:39,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:49:39,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:39,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:39,644 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:39,671 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:39,672 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:39,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:39,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:39,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:49:39,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:39,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:49:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:49:39,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:49:39,915 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-25 15:49:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:40,024 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:49:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:49:40,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-25 15:49:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:40,025 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:49:40,026 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:49:40,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:49:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:49:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-25 15:49:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:49:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:49:40,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-02-25 15:49:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:40,030 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:49:40,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:49:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:49:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:49:40,033 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:40,034 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-02-25 15:49:40,034 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-02-25 15:49:40,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:40,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:40,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:40,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:40,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:40,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:49:40,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:40,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:49:40,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:40,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:40,270 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,368 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:49:40,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:49:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:49:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:49:40,617 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-02-25 15:49:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:40,761 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:49:40,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:49:40,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-25 15:49:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:40,764 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:49:40,764 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:49:40,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:49:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:49:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-25 15:49:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:49:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:49:40,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-02-25 15:49:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:40,769 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:49:40,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:49:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:49:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:49:40,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:40,770 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-02-25 15:49:40,770 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-02-25 15:49:40,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:40,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:40,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:40,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:40,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:40,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:40,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:40,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:40,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:40,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:40,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:40,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:40,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:49:40,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:40,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:40,946 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,962 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:40,962 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:41,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:41,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:49:41,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:41,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:49:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:49:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:49:41,541 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-02-25 15:49:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:41,869 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-25 15:49:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:49:41,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-02-25 15:49:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:41,871 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:49:41,871 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:49:41,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:49:41,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:49:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-25 15:49:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:49:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-25 15:49:41,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-02-25 15:49:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:41,876 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-25 15:49:41,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:49:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-25 15:49:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-25 15:49:41,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:41,876 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-02-25 15:49:41,877 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-02-25 15:49:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:41,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:41,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:42,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:42,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:42,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:42,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:42,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:42,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:49:42,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:42,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:42,083 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,094 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:42,275 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:42,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:49:42,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:42,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:49:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:49:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:49:42,297 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-02-25 15:49:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:42,341 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-25 15:49:42,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:49:42,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-02-25 15:49:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:42,344 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:49:42,344 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:49:42,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:49:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:49:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-02-25 15:49:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:49:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-25 15:49:42,348 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-02-25 15:49:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:42,348 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-25 15:49:42,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:49:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-25 15:49:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:49:42,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:42,350 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-02-25 15:49:42,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-02-25 15:49:42,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:42,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:42,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:42,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:42,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:42,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:42,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:42,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:42,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:42,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:49:42,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:42,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:49:42,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:42,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:42,523 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,535 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:42,536 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:42,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:42,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:49:42,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:42,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:49:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:49:42,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:49:42,826 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-02-25 15:49:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:42,908 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-25 15:49:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:49:42,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-02-25 15:49:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:42,909 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:49:42,910 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:49:42,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:49:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:49:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-25 15:49:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:49:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-25 15:49:42,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-02-25 15:49:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:42,915 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-25 15:49:42,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:49:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-25 15:49:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-25 15:49:42,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:42,916 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-02-25 15:49:42,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-02-25 15:49:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:42,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:42,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:42,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:43,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:43,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:43,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:43,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:43,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:43,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:43,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:43,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:49:43,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:43,085 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:43,085 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:43,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:43,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-25 15:49:43,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:43,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:49:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:49:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:49:43,366 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-02-25 15:49:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:43,460 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:49:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:49:43,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-02-25 15:49:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:43,463 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:49:43,463 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:49:43,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:49:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:49:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-25 15:49:43,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:49:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:49:43,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-02-25 15:49:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:43,469 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:49:43,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:49:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:49:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:49:43,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:43,470 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-02-25 15:49:43,470 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:43,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-02-25 15:49:43,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:43,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:43,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:43,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:43,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:43,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:43,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:43,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:43,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:43,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:43,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:43,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:43,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:49:43,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:43,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:43,623 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:43,633 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:43,634 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:43,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-25 15:49:43,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:49:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:49:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:49:43,908 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-02-25 15:49:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:44,099 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-25 15:49:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:49:44,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-02-25 15:49:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:44,100 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:49:44,101 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:49:44,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:49:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:49:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-25 15:49:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:49:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-25 15:49:44,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-02-25 15:49:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:44,106 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-25 15:49:44,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:49:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-25 15:49:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:49:44,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:44,108 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-02-25 15:49:44,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-02-25 15:49:44,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:44,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:44,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:44,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:44,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:44,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:44,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:44,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:44,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:49:44,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:44,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:49:44,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:44,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:44,288 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:44,302 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:44,303 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:44,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:44,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:44,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-25 15:49:44,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:44,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:49:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:49:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:49:44,667 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-02-25 15:49:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:44,829 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-25 15:49:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:49:44,830 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-02-25 15:49:44,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:44,831 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:49:44,832 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:49:44,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:49:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:49:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-25 15:49:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:49:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-25 15:49:44,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-02-25 15:49:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:44,838 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-25 15:49:44,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:49:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-25 15:49:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:49:44,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:44,839 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-02-25 15:49:44,839 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-02-25 15:49:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:44,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:44,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:45,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:45,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:45,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:45,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:45,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:45,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:45,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:45,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:45,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:45,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:45,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:49:45,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:45,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:45,080 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:45,091 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:45,092 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:45,378 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-25 15:49:45,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:45,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:49:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:49:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:49:45,728 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-02-25 15:49:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:45,816 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-25 15:49:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:49:45,817 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-02-25 15:49:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:45,818 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:49:45,818 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:49:45,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:49:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:49:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-25 15:49:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:49:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-25 15:49:45,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-02-25 15:49:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:45,825 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-25 15:49:45,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:49:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-25 15:49:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-25 15:49:45,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:45,826 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-02-25 15:49:45,826 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-02-25 15:49:45,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:45,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:45,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:45,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:45,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:46,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:46,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:46,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:46,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:46,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:46,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:46,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:46,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:49:46,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:46,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:46,073 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:46,092 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:46,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:46,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-25 15:49:46,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:46,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:49:46,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:49:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:49:46,442 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-02-25 15:49:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:46,536 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:49:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:49:46,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-02-25 15:49:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:46,539 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:49:46,539 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:49:46,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:49:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:49:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-25 15:49:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:49:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:49:46,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-02-25 15:49:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:46,546 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:49:46,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:49:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:49:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:49:46,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:46,547 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-02-25 15:49:46,547 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-02-25 15:49:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:46,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:46,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:46,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:46,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:46,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:46,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:46,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:46,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:46,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:46,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-25 15:49:46,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:46,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:49:46,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:46,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:46,977 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:46,989 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:46,989 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:47,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-25 15:49:47,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:47,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:49:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:49:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:49:47,520 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-02-25 15:49:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:47,618 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-25 15:49:47,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:49:47,619 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-02-25 15:49:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:47,619 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:49:47,620 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:49:47,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:49:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:49:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-25 15:49:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:49:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-25 15:49:47,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-02-25 15:49:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:47,626 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-25 15:49:47,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:49:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-25 15:49:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-25 15:49:47,628 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:47,628 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-02-25 15:49:47,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-02-25 15:49:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:47,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:47,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:47,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:47,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:47,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:47,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:47,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:47,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:47,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:47,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:47,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:47,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:49:47,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:47,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:47,984 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:47,992 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:47,992 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:48,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-25 15:49:48,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:49:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:49:48,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:49:48,462 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-02-25 15:49:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:48,567 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-25 15:49:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:49:48,567 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-02-25 15:49:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:48,568 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:49:48,568 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:49:48,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:49:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:49:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-02-25 15:49:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:49:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-25 15:49:48,576 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-02-25 15:49:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:48,576 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-25 15:49:48,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:49:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-25 15:49:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:49:48,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:48,578 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-02-25 15:49:48,578 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-02-25 15:49:48,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:48,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:48,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:48,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:48,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:48,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:48,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:48,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:48,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:48,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:48,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:49:48,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:48,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:48,840 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:48,844 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:48,845 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:49,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-25 15:49:49,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:49:49,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:49:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:49:49,965 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-02-25 15:49:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:50,064 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-25 15:49:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:49:50,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-02-25 15:49:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:50,066 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:49:50,066 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:49:50,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:49:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:49:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-25 15:49:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:49:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-25 15:49:50,073 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-02-25 15:49:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:50,073 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-25 15:49:50,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:49:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-25 15:49:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-25 15:49:50,074 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:50,074 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-02-25 15:49:50,074 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-02-25 15:49:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:50,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:50,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:50,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:50,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:50,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:50,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:50,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:50,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:50,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:50,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:49:50,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:50,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:49:50,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:50,389 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:50,390 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:50,397 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:50,397 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:51,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-25 15:49:51,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:51,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:49:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:49:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:49:51,736 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-02-25 15:49:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:51,957 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:49:51,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:49:51,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-02-25 15:49:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:51,958 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:49:51,958 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:49:51,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:49:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:49:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-25 15:49:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:49:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:49:51,964 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-02-25 15:49:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:51,965 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:49:51,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:49:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:49:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:49:51,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:51,966 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-02-25 15:49:51,966 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-02-25 15:49:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:51,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:51,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:52,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:52,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:52,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:52,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:52,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:52,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:52,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:52,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:52,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:52,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:52,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:49:52,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:52,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:52,290 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:52,297 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:52,298 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:52,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:52,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:52,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-25 15:49:52,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:52,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:49:52,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:49:52,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:49:52,889 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-02-25 15:49:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:52,995 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-25 15:49:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:49:52,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-02-25 15:49:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:52,997 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:49:52,997 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:49:52,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:49:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:49:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-25 15:49:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:49:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-25 15:49:53,004 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-02-25 15:49:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:53,004 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-25 15:49:53,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:49:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-25 15:49:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:49:53,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:53,005 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-02-25 15:49:53,005 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:53,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-02-25 15:49:53,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:53,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:53,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:53,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:53,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:53,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:53,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:53,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:53,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:53,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:53,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:53,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:49:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:53,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:53,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:53,751 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:53,751 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:55,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:55,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:55,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-25 15:49:55,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:55,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:49:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:49:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:49:55,834 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-02-25 15:49:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:56,000 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-25 15:49:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:49:56,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-02-25 15:49:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:56,001 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:49:56,001 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:49:56,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:49:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:49:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-02-25 15:49:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:49:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-25 15:49:56,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-02-25 15:49:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:56,008 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-25 15:49:56,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:49:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-25 15:49:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:49:56,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:56,009 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-02-25 15:49:56,009 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:56,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-02-25 15:49:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:56,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:56,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:56,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:56,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:56,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:56,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:56,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:56,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:56,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:49:56,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:56,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:49:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:56,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:56,358 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:56,367 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:56,367 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:56,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:57,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-25 15:49:57,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:57,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:49:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:49:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:49:57,096 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-02-25 15:49:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:57,216 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-25 15:49:57,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:49:57,217 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-02-25 15:49:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:57,217 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:49:57,218 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:49:57,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:49:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:49:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-25 15:49:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:49:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-25 15:49:57,224 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-02-25 15:49:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:57,225 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-25 15:49:57,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:49:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-25 15:49:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-25 15:49:57,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:57,226 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-02-25 15:49:57,226 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-02-25 15:49:57,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:57,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:57,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:57,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:57,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:57,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:57,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:57,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:57,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:57,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:49:57,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:49:57,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:49:57,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:57,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:49:57,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:57,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:57,627 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:57,640 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:57,640 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:58,164 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-25 15:49:58,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:58,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:49:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:49:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:49:58,827 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-02-25 15:49:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:58,945 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:49:58,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:49:58,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-02-25 15:49:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:58,947 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:49:58,947 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:49:58,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:49:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:49:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-25 15:49:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:49:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:49:58,953 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-02-25 15:49:58,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:58,954 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:49:58,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:49:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:49:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:49:58,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:58,955 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-02-25 15:49:58,955 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-02-25 15:49:58,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:58,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:58,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:58,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:59,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:59,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:59,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:59,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:59,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:59,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:59,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:59,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:49:59,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:59,303 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:49:59,303 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:49:59,312 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:49:59,312 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:49:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:49:59,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:00,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:00,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-25 15:50:00,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:50:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:50:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:50:00,228 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-02-25 15:50:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:00,369 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-25 15:50:00,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:50:00,369 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-02-25 15:50:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:00,370 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:50:00,370 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:50:00,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:50:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:50:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-25 15:50:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:50:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-25 15:50:00,377 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-02-25 15:50:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:00,378 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-25 15:50:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:50:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-25 15:50:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-25 15:50:00,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:00,379 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-02-25 15:50:00,379 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-02-25 15:50:00,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:00,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:00,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:00,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:00,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:00,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:00,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:00,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:00,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:00,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:00,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-25 15:50:00,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:00,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:50:00,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:00,758 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:00,758 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:00,775 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:00,776 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:01,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:02,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:02,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-25 15:50:02,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:02,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:50:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:50:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:50:02,048 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-02-25 15:50:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:02,218 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-25 15:50:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:50:02,218 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-02-25 15:50:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:02,219 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:50:02,219 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:50:02,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:50:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:50:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-02-25 15:50:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:50:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-25 15:50:02,226 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-02-25 15:50:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:02,227 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-25 15:50:02,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:50:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-25 15:50:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:50:02,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:02,228 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-02-25 15:50:02,232 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-02-25 15:50:02,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:02,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:02,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:02,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:02,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:02,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:02,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:02,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:02,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:02,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:02,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:02,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:02,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:02,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:50:02,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:02,674 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:02,674 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:02,680 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:02,680 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:03,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:03,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:03,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-25 15:50:03,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:03,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:50:03,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:50:03,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:50:03,828 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-02-25 15:50:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:03,962 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-25 15:50:03,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:50:03,964 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-02-25 15:50:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:03,965 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:50:03,965 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:50:03,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:50:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:50:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-25 15:50:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:50:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-25 15:50:03,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-02-25 15:50:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:03,970 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-25 15:50:03,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:50:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-25 15:50:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:50:03,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:03,971 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-02-25 15:50:03,971 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-02-25 15:50:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:03,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:03,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:04,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:04,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:04,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:04,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:04,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:04,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:04,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:04,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:04,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:50:04,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:04,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:04,623 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:04,631 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:04,632 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:05,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:05,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:05,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-25 15:50:05,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:05,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:50:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:50:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:50:05,766 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-02-25 15:50:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:05,939 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:50:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:50:05,939 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-02-25 15:50:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:05,940 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:50:05,940 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:50:05,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:50:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:50:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-25 15:50:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:50:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:50:05,946 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-02-25 15:50:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:05,946 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:50:05,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:50:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:50:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:50:05,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:05,947 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-02-25 15:50:05,947 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-02-25 15:50:05,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:05,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:05,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:06,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:06,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:06,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:06,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:06,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:06,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:06,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:06,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:06,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:50:06,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:06,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:50:06,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:06,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:06,606 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:06,620 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:06,621 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:07,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:07,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:07,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-25 15:50:07,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:07,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:50:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:50:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:50:07,873 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-02-25 15:50:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:08,032 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-25 15:50:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:50:08,032 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-02-25 15:50:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:08,033 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:50:08,034 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:50:08,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:50:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:50:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-25 15:50:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-25 15:50:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-25 15:50:08,038 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-02-25 15:50:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:08,038 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-25 15:50:08,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:50:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-25 15:50:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-25 15:50:08,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:08,039 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-02-25 15:50:08,039 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-02-25 15:50:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:08,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:08,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:08,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:08,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:08,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:08,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:08,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:08,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:08,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:08,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:08,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:08,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:08,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:08,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:50:08,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:08,509 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:08,510 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:08,517 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:08,518 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:08,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:09,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:09,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-25 15:50:09,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:09,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:50:09,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:50:09,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:50:09,763 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-02-25 15:50:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:09,961 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-25 15:50:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:50:09,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-02-25 15:50:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:09,962 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:50:09,963 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:50:09,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:50:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:50:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-02-25 15:50:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:50:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-25 15:50:09,968 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-02-25 15:50:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:09,968 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-25 15:50:09,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:50:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-25 15:50:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:50:09,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:09,969 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-02-25 15:50:09,970 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:09,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-02-25 15:50:09,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:09,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:09,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:09,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:10,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:10,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:10,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:10,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:10,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:10,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:10,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:10,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:50:10,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:10,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:10,610 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:10,618 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:10,619 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:11,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:12,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:12,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-25 15:50:12,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:12,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:50:12,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:50:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:50:12,210 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-02-25 15:50:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:12,405 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-25 15:50:12,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:50:12,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-02-25 15:50:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:12,407 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:50:12,407 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:50:12,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:50:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:50:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-25 15:50:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-25 15:50:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-25 15:50:12,411 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-02-25 15:50:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:12,411 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-25 15:50:12,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:50:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-25 15:50:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-25 15:50:12,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:12,412 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-02-25 15:50:12,412 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:12,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-02-25 15:50:12,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:12,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:12,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:12,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:12,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:12,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:12,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:12,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:12,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:12,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:12,951 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:13,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:50:13,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:13,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:50:13,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:13,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:13,010 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:13,021 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:13,021 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:13,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:14,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-25 15:50:14,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:14,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:50:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:50:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:50:14,686 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-02-25 15:50:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:14,841 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:50:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:50:14,841 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-02-25 15:50:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:14,842 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:50:14,842 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:50:14,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:50:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:50:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-25 15:50:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:50:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:50:14,847 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-02-25 15:50:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:14,848 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:50:14,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:50:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:50:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:50:14,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:14,849 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-02-25 15:50:14,849 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-02-25 15:50:14,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:14,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:14,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:15,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:15,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:15,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:15,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:15,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:15,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:15,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:15,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:15,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:15,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:50:15,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:15,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:15,350 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:15,359 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:15,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:15,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:17,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:17,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-25 15:50:17,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:17,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:50:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:50:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:50:17,196 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-02-25 15:50:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:17,370 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-25 15:50:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:50:17,370 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-02-25 15:50:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:17,371 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:50:17,372 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:50:17,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:50:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:50:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-25 15:50:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-25 15:50:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-25 15:50:17,377 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-02-25 15:50:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:17,377 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-25 15:50:17,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:50:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-25 15:50:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-25 15:50:17,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:17,378 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-02-25 15:50:17,378 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-02-25 15:50:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:17,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:17,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:17,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:17,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:17,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:17,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:17,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:17,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:17,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:17,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:50:17,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:17,972 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:17,972 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:17,981 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:17,981 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:18,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:19,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:19,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-25 15:50:19,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:19,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:50:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:50:19,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:50:19,981 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-02-25 15:50:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:20,185 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-25 15:50:20,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:50:20,185 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-02-25 15:50:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:20,187 INFO L225 Difference]: With dead ends: 93 [2019-02-25 15:50:20,187 INFO L226 Difference]: Without dead ends: 92 [2019-02-25 15:50:20,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:50:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-25 15:50:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-02-25 15:50:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:50:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-25 15:50:20,192 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-02-25 15:50:20,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:20,193 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-25 15:50:20,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:50:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-25 15:50:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:50:20,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:20,194 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-02-25 15:50:20,194 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:20,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-02-25 15:50:20,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:20,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:21,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:21,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:21,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:21,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:21,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:21,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:21,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:21,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:50:21,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:21,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:50:21,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:21,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:21,147 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:21,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:21,169 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:22,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:23,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-25 15:50:23,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:23,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:50:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:50:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:50:23,192 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-02-25 15:50:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:23,375 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-25 15:50:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:50:23,375 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-02-25 15:50:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:23,376 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:50:23,377 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:50:23,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:50:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:50:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-25 15:50:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:50:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-25 15:50:23,381 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-02-25 15:50:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-25 15:50:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:50:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-25 15:50:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:50:23,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:23,382 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-02-25 15:50:23,382 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:23,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-02-25 15:50:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:23,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:23,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:23,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:23,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:23,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:23,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:23,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:24,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:24,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:24,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:24,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:24,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:50:24,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:24,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:24,041 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:24,056 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:24,056 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:24,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:25,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:25,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-25 15:50:25,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:25,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:50:25,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:50:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:50:25,869 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-02-25 15:50:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:26,064 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:50:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:50:26,065 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-02-25 15:50:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:26,066 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:50:26,066 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:50:26,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:50:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:50:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-25 15:50:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:50:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:50:26,071 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-02-25 15:50:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:26,071 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:50:26,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:50:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:50:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:50:26,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:26,072 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-02-25 15:50:26,072 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-02-25 15:50:26,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:26,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:26,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:26,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:27,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:27,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:27,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:27,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:27,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:27,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:27,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:27,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:50:27,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:27,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:27,105 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:27,120 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:27,121 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:27,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:29,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:29,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-25 15:50:29,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:29,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:50:29,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:50:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:50:29,117 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-02-25 15:50:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:29,359 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-25 15:50:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:50:29,360 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-02-25 15:50:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:29,361 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:50:29,361 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:50:29,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:50:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:50:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-25 15:50:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:50:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-25 15:50:29,366 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-02-25 15:50:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:29,366 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-25 15:50:29,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:50:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-25 15:50:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-25 15:50:29,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:29,367 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-02-25 15:50:29,367 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-02-25 15:50:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:29,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:29,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:29,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:29,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:29,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:29,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:29,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:29,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:29,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:30,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-25 15:50:30,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:30,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:50:30,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:30,108 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:30,109 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:30,202 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:30,203 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:30,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:32,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:32,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-25 15:50:32,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:32,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:50:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:50:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:50:32,455 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-02-25 15:50:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:32,699 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-25 15:50:32,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:50:32,699 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-02-25 15:50:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:32,700 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:50:32,700 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:50:32,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:50:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:50:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-25 15:50:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:50:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-25 15:50:32,705 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-02-25 15:50:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:32,706 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-25 15:50:32,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:50:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-25 15:50:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:50:32,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:32,707 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-02-25 15:50:32,707 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-02-25 15:50:32,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:32,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:32,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:32,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:33,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:33,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:33,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:33,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:33,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:33,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:33,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:33,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:33,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:33,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:50:33,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:33,458 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:33,458 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:33,468 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:33,468 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:34,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:35,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:35,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-25 15:50:35,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:35,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:50:35,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:50:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:50:35,737 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-02-25 15:50:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:35,980 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-25 15:50:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:50:35,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-02-25 15:50:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:35,982 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:50:35,982 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:50:35,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:50:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:50:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-25 15:50:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:50:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-25 15:50:35,987 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-02-25 15:50:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:35,988 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-25 15:50:35,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:50:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-25 15:50:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-25 15:50:35,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:35,988 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-02-25 15:50:35,989 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-02-25 15:50:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:35,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:35,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:36,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:36,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:36,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:36,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:36,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:36,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:36,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:36,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:36,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:50:36,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:36,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:36,865 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:36,910 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:36,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:37,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:39,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:39,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-25 15:50:39,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:39,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:50:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:50:39,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:50:39,395 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-02-25 15:50:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:39,633 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:50:39,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:50:39,634 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-02-25 15:50:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:39,635 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:50:39,635 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:50:39,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:50:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:50:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-25 15:50:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:50:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:50:39,639 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-02-25 15:50:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:39,640 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:50:39,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:50:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:50:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:50:39,640 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:39,640 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-02-25 15:50:39,641 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-02-25 15:50:39,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:39,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:40,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:40,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:40,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:40,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:40,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:40,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:40,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:40,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:40,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:50:40,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:40,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:50:40,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:40,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:40,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:40,451 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:40,451 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:41,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:43,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:43,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-25 15:50:43,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:43,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:50:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:50:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:50:43,090 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-02-25 15:50:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:43,431 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-25 15:50:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:50:43,432 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-02-25 15:50:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:43,433 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:50:43,433 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:50:43,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:50:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:50:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-25 15:50:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:50:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-25 15:50:43,440 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-02-25 15:50:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:43,440 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-25 15:50:43,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:50:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-25 15:50:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:50:43,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:43,441 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-02-25 15:50:43,441 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:43,442 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-02-25 15:50:43,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:43,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:43,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:43,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:44,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:44,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:44,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:44,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:44,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:44,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:44,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:44,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:44,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-25 15:50:44,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:44,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:44,862 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:44,872 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:44,872 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:45,871 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:47,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-25 15:50:47,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:50:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:50:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:50:47,699 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-02-25 15:50:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:47,921 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-25 15:50:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:50:47,921 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-02-25 15:50:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:47,922 INFO L225 Difference]: With dead ends: 117 [2019-02-25 15:50:47,922 INFO L226 Difference]: Without dead ends: 116 [2019-02-25 15:50:47,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:50:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-25 15:50:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-02-25 15:50:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:50:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-25 15:50:47,928 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-02-25 15:50:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-25 15:50:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:50:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-25 15:50:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:50:47,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:47,929 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-02-25 15:50:47,929 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-02-25 15:50:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:47,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:47,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:48,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:48,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:48,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:48,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:48,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:48,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:48,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:50:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:48,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-25 15:50:48,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:48,742 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:48,742 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:48,751 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:48,751 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:49,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:51,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-25 15:50:51,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:51,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:50:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:50:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:50:51,465 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-02-25 15:50:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:51,765 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-25 15:50:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:50:51,765 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-02-25 15:50:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:51,767 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:50:51,767 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:50:51,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:50:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:50:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-25 15:50:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-25 15:50:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-25 15:50:51,771 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-02-25 15:50:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:51,772 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-25 15:50:51,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:50:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-25 15:50:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-25 15:50:51,772 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:51,772 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-02-25 15:50:51,772 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-02-25 15:50:51,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:51,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:50:51,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:51,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:52,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:52,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:52,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:52,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:52,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:52,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:52,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:50:52,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:50:53,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-25 15:50:53,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:53,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-25 15:50:53,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:53,087 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:53,087 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:53,096 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:53,096 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:54,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:50:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:56,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:50:56,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-25 15:50:56,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:50:56,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:50:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:50:56,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:50:56,326 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-02-25 15:50:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:50:56,666 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-25 15:50:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:50:56,667 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-02-25 15:50:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:50:56,668 INFO L225 Difference]: With dead ends: 123 [2019-02-25 15:50:56,668 INFO L226 Difference]: Without dead ends: 122 [2019-02-25 15:50:56,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:50:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-25 15:50:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-25 15:50:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:50:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-25 15:50:56,673 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-02-25 15:50:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:50:56,673 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-25 15:50:56,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:50:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-25 15:50:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:50:56,674 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:50:56,674 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-02-25 15:50:56,674 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:50:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:50:56,674 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-02-25 15:50:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:50:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:56,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:50:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:50:56,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:50:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:50:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:57,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:57,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:50:57,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:50:57,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:50:57,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:50:57,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:50:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:50:57,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:50:58,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:50:58,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:50:58,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-25 15:50:58,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:50:58,062 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:50:58,063 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:50:58,149 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:50:58,149 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:50:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:50:59,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:01,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:01,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-25 15:51:01,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:01,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:51:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:51:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:51:01,593 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-02-25 15:51:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:01,894 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-25 15:51:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:51:01,895 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-02-25 15:51:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:01,896 INFO L225 Difference]: With dead ends: 126 [2019-02-25 15:51:01,896 INFO L226 Difference]: Without dead ends: 125 [2019-02-25 15:51:01,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:51:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-25 15:51:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-25 15:51:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-25 15:51:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-25 15:51:01,901 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-02-25 15:51:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:01,901 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-25 15:51:01,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:51:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-25 15:51:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-25 15:51:01,902 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:01,902 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-02-25 15:51:01,902 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-02-25 15:51:01,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:01,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:01,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:04,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:04,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:04,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:04,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:04,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:04,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:04,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-25 15:51:04,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:04,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:04,193 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:04,201 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:04,201 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:05,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:07,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-25 15:51:07,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:07,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:51:07,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:51:07,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:51:07,308 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-02-25 15:51:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:07,743 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-02-25 15:51:07,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:51:07,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-02-25 15:51:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:07,745 INFO L225 Difference]: With dead ends: 129 [2019-02-25 15:51:07,745 INFO L226 Difference]: Without dead ends: 128 [2019-02-25 15:51:07,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:51:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-25 15:51:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-02-25 15:51:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-25 15:51:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-02-25 15:51:07,752 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-02-25 15:51:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-02-25 15:51:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:51:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-02-25 15:51:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-25 15:51:07,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:07,754 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-02-25 15:51:07,754 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-02-25 15:51:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:07,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:07,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:08,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:08,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:08,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:08,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:09,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:09,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-25 15:51:09,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:09,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-25 15:51:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:09,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:09,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:09,163 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:09,163 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:10,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-25 15:51:12,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:51:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:51:12,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:51:12,410 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-02-25 15:51:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:12,801 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-25 15:51:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:51:12,802 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-02-25 15:51:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:12,803 INFO L225 Difference]: With dead ends: 132 [2019-02-25 15:51:12,803 INFO L226 Difference]: Without dead ends: 131 [2019-02-25 15:51:12,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:51:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-25 15:51:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-25 15:51:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-25 15:51:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-25 15:51:12,808 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-02-25 15:51:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:12,809 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-25 15:51:12,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:51:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-25 15:51:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-25 15:51:12,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:12,810 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-02-25 15:51:12,810 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-02-25 15:51:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:12,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:12,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:14,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:14,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:14,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:14,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:14,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:14,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:14,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:14,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:14,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:14,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:14,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-25 15:51:14,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:14,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:14,188 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:14,195 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:14,196 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:15,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:17,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:17,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-25 15:51:17,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:17,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:51:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:51:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:51:17,712 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-02-25 15:51:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:18,240 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-25 15:51:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:51:18,242 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-02-25 15:51:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:18,243 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:51:18,244 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:51:18,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:51:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:51:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-25 15:51:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:51:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-25 15:51:18,250 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-02-25 15:51:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:18,250 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-25 15:51:18,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:51:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-25 15:51:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:51:18,251 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:18,251 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-02-25 15:51:18,251 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-02-25 15:51:18,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:18,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:18,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:18,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:18,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:19,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:19,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:19,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:19,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:19,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:19,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:19,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:19,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:51:19,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:19,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:19,923 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:19,935 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:19,936 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:21,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-25 15:51:23,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:23,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:51:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:51:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:51:23,676 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-02-25 15:51:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:23,931 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-25 15:51:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:51:23,931 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-02-25 15:51:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:23,933 INFO L225 Difference]: With dead ends: 138 [2019-02-25 15:51:23,933 INFO L226 Difference]: Without dead ends: 137 [2019-02-25 15:51:23,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:51:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-25 15:51:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-25 15:51:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-25 15:51:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-25 15:51:23,939 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-02-25 15:51:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:23,939 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-25 15:51:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:51:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-25 15:51:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-25 15:51:23,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:23,940 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-02-25 15:51:23,941 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-02-25 15:51:23,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:23,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:23,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:25,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:25,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:25,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:25,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:25,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:25,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:25,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:25,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:25,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-25 15:51:25,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:25,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-25 15:51:25,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:25,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:25,454 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:25,466 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:25,466 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:26,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:29,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:29,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-25 15:51:29,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:29,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:51:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:51:29,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:51:29,248 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-02-25 15:51:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:29,523 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-02-25 15:51:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:51:29,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-02-25 15:51:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:29,528 INFO L225 Difference]: With dead ends: 141 [2019-02-25 15:51:29,528 INFO L226 Difference]: Without dead ends: 140 [2019-02-25 15:51:29,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:51:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-25 15:51:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-02-25 15:51:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:51:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-02-25 15:51:29,534 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-02-25 15:51:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:29,534 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-02-25 15:51:29,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:51:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-02-25 15:51:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-25 15:51:29,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:29,535 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-02-25 15:51:29,535 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-02-25 15:51:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:29,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:29,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:29,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:31,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:31,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:31,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:31,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:31,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:31,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:31,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:31,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:31,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:31,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:31,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-25 15:51:31,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:31,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:31,095 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,154 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,154 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:32,367 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:35,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-25 15:51:35,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:35,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:51:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:51:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:51:35,340 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-02-25 15:51:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:35,779 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-02-25 15:51:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:51:35,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-02-25 15:51:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:35,781 INFO L225 Difference]: With dead ends: 144 [2019-02-25 15:51:35,781 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:51:35,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:51:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:51:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-02-25 15:51:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-25 15:51:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-02-25 15:51:35,789 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-02-25 15:51:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:35,790 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-02-25 15:51:35,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:51:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-02-25 15:51:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-02-25 15:51:35,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:35,791 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-02-25 15:51:35,791 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-02-25 15:51:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:35,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:35,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:37,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:37,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:37,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:37,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:37,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:37,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:37,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 148 conjunts are in the unsatisfiable core [2019-02-25 15:51:37,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:37,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:37,404 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:37,414 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:37,414 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:38,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-25 15:51:41,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:41,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:51:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:51:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:51:41,795 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-02-25 15:51:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:42,145 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-25 15:51:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:51:42,145 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-02-25 15:51:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:42,146 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:51:42,147 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:51:42,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:51:42,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:51:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-25 15:51:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:51:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-25 15:51:42,153 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-02-25 15:51:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:42,154 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-25 15:51:42,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:51:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-25 15:51:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:51:42,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:42,155 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-02-25 15:51:42,155 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-02-25 15:51:42,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:42,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:43,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:43,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:43,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:43,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:43,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:43,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:43,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:43,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:43,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-25 15:51:43,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:43,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-25 15:51:43,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:43,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:43,652 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,697 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,697 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:47,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:47,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-25 15:51:47,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:47,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:51:47,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:51:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:51:47,806 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-02-25 15:51:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:48,146 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-25 15:51:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:51:48,147 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-02-25 15:51:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:48,148 INFO L225 Difference]: With dead ends: 150 [2019-02-25 15:51:48,148 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:51:48,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:51:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:51:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-02-25 15:51:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-25 15:51:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-02-25 15:51:48,154 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-02-25 15:51:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:48,155 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-02-25 15:51:48,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:51:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-02-25 15:51:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-02-25 15:51:48,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:48,155 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-02-25 15:51:48,156 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-02-25 15:51:48,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:48,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:48,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:48,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:49,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:49,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:49,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:49,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:49,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:51:49,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:51:49,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:51:49,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:49,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-25 15:51:49,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:49,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:49,650 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,739 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:51,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:54,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:54,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-25 15:51:54,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:54,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:51:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:51:54,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:51:54,350 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-02-25 15:51:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:54,801 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-02-25 15:51:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:51:54,801 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-02-25 15:51:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:54,802 INFO L225 Difference]: With dead ends: 153 [2019-02-25 15:51:54,802 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:51:54,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:51:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:51:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-02-25 15:51:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-25 15:51:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-25 15:51:54,810 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-02-25 15:51:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:54,810 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-25 15:51:54,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:51:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-25 15:51:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-25 15:51:54,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:54,811 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-02-25 15:51:54,811 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-02-25 15:51:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:54,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:54,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:56,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:56,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:56,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:56,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:56,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 157 conjunts are in the unsatisfiable core [2019-02-25 15:51:56,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:56,145 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:51:56,145 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,153 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,153 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:51:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:57,667 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:01,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:01,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-25 15:52:01,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:01,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:52:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:52:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:52:01,019 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-02-25 15:52:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:01,385 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-02-25 15:52:01,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:52:01,385 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-02-25 15:52:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:01,386 INFO L225 Difference]: With dead ends: 156 [2019-02-25 15:52:01,386 INFO L226 Difference]: Without dead ends: 155 [2019-02-25 15:52:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:52:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-25 15:52:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-02-25 15:52:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-02-25 15:52:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-02-25 15:52:01,393 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-02-25 15:52:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:01,393 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-02-25 15:52:01,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:52:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-02-25 15:52:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-02-25 15:52:01,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:01,394 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-02-25 15:52:01,394 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:01,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-02-25 15:52:01,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:01,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:02,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:02,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:02,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:02,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:02,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:02,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-25 15:52:02,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:02,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-25 15:52:02,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:02,988 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:02,988 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,999 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,000 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:04,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:07,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-25 15:52:07,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:07,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:52:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:52:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:52:07,964 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-02-25 15:52:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:08,319 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-25 15:52:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:52:08,319 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-02-25 15:52:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:08,321 INFO L225 Difference]: With dead ends: 159 [2019-02-25 15:52:08,321 INFO L226 Difference]: Without dead ends: 158 [2019-02-25 15:52:08,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:52:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-25 15:52:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-25 15:52:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:52:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-25 15:52:08,325 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-02-25 15:52:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:08,325 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-25 15:52:08,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:52:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-25 15:52:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:52:08,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:08,326 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-02-25 15:52:08,327 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-02-25 15:52:08,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:10,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:10,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:10,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:10,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:10,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:10,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:10,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:10,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:10,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-25 15:52:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:10,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:10,442 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,452 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,452 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:13,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:16,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:16,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-25 15:52:16,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:16,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:52:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:52:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:52:16,707 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-02-25 15:52:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:17,074 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-02-25 15:52:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:52:17,074 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-02-25 15:52:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:17,075 INFO L225 Difference]: With dead ends: 162 [2019-02-25 15:52:17,075 INFO L226 Difference]: Without dead ends: 161 [2019-02-25 15:52:17,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:52:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-25 15:52:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-02-25 15:52:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-02-25 15:52:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-02-25 15:52:17,082 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-02-25 15:52:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:17,082 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-02-25 15:52:17,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:52:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-02-25 15:52:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-02-25 15:52:17,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:17,083 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-02-25 15:52:17,083 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-02-25 15:52:17,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:17,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:18,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:18,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:18,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:18,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:18,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:18,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-25 15:52:18,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:18,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:18,523 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,536 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,536 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:23,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:23,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-25 15:52:23,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:23,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:52:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:52:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:52:23,646 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-02-25 15:52:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:24,063 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-25 15:52:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:52:24,063 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-02-25 15:52:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:24,064 INFO L225 Difference]: With dead ends: 165 [2019-02-25 15:52:24,064 INFO L226 Difference]: Without dead ends: 164 [2019-02-25 15:52:24,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:52:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-25 15:52:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-02-25 15:52:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-25 15:52:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-02-25 15:52:24,069 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-02-25 15:52:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:24,070 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-02-25 15:52:24,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:52:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-02-25 15:52:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-25 15:52:24,070 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:24,071 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-02-25 15:52:24,071 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-02-25 15:52:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:24,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:24,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:25,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:25,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:25,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:25,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:25,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:25,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:25,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:25,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:25,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-25 15:52:25,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:25,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-25 15:52:25,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:25,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:25,945 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,955 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,955 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:32,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:32,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-25 15:52:32,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:32,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:52:32,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:52:32,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:52:32,082 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-02-25 15:52:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:32,503 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-02-25 15:52:32,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:52:32,504 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-02-25 15:52:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:32,505 INFO L225 Difference]: With dead ends: 168 [2019-02-25 15:52:32,505 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:52:32,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:52:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:52:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-02-25 15:52:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-25 15:52:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-25 15:52:32,510 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-02-25 15:52:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:32,510 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-25 15:52:32,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:52:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-25 15:52:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-25 15:52:32,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:32,511 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-02-25 15:52:32,511 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:32,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-02-25 15:52:32,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:32,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:33,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:33,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:33,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:33,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:33,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:33,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:33,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:34,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:34,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:34,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-25 15:52:34,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:34,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:34,039 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,132 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,133 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:39,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-25 15:52:39,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:39,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:52:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:52:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:52:39,541 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-02-25 15:52:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,000 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-25 15:52:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:52:40,001 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-02-25 15:52:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,002 INFO L225 Difference]: With dead ends: 171 [2019-02-25 15:52:40,002 INFO L226 Difference]: Without dead ends: 170 [2019-02-25 15:52:40,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:52:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-25 15:52:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-25 15:52:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:52:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-25 15:52:40,009 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-02-25 15:52:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,009 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-25 15:52:40,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:52:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-25 15:52:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:52:40,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,010 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-02-25 15:52:40,010 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-02-25 15:52:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:41,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:41,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:41,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:41,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 175 conjunts are in the unsatisfiable core [2019-02-25 15:52:41,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:41,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:41,630 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,639 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,639 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:46,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:46,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-25 15:52:46,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:46,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-25 15:52:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-25 15:52:46,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:52:46,966 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-02-25 15:52:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:47,337 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-02-25 15:52:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:52:47,337 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-02-25 15:52:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:47,338 INFO L225 Difference]: With dead ends: 174 [2019-02-25 15:52:47,338 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:52:47,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:52:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:52:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-02-25 15:52:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-02-25 15:52:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-02-25 15:52:47,343 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-02-25 15:52:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:47,343 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-02-25 15:52:47,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-25 15:52:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-02-25 15:52:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-02-25 15:52:47,343 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:47,344 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-02-25 15:52:47,344 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-02-25 15:52:47,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:47,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:48,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:48,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:48,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:48,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:48,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:48,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:49,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-25 15:52:49,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:49,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-25 15:52:49,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:49,192 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:49,192 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,201 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,201 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:51,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:54,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:54,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-25 15:52:54,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:54,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-25 15:52:54,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-25 15:52:54,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:52:54,669 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-02-25 15:52:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:55,133 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-02-25 15:52:55,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:52:55,133 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-02-25 15:52:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:55,134 INFO L225 Difference]: With dead ends: 177 [2019-02-25 15:52:55,134 INFO L226 Difference]: Without dead ends: 176 [2019-02-25 15:52:55,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:52:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-02-25 15:52:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-02-25 15:52:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:52:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-02-25 15:52:55,140 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-02-25 15:52:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:55,140 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-02-25 15:52:55,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-25 15:52:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-02-25 15:52:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:52:55,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:55,141 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-02-25 15:52:55,141 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-02-25 15:52:55,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:55,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:56,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:56,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:56,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:56,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:56,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:56,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:56,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:56,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:56,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:56,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-25 15:52:56,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:56,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:52:56,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,837 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,837 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:52:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:02,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-25 15:53:02,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:02,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-25 15:53:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-25 15:53:02,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:53:02,481 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-02-25 15:53:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:02,906 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-25 15:53:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:53:02,906 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-02-25 15:53:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:02,907 INFO L225 Difference]: With dead ends: 180 [2019-02-25 15:53:02,907 INFO L226 Difference]: Without dead ends: 179 [2019-02-25 15:53:02,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:53:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-25 15:53:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-02-25 15:53:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:53:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-02-25 15:53:02,913 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-02-25 15:53:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:02,913 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-02-25 15:53:02,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-25 15:53:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-02-25 15:53:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-25 15:53:02,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:02,914 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-02-25 15:53:02,914 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:02,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-02-25 15:53:02,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:02,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:02,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:02,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:02,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:04,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:04,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:04,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:04,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:04,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:04,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:04,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:04,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:04,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 184 conjunts are in the unsatisfiable core [2019-02-25 15:53:04,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:04,593 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:04,593 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,607 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,607 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:06,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-25 15:53:10,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:10,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-25 15:53:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-25 15:53:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:53:10,290 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-02-25 15:53:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:10,800 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-25 15:53:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:53:10,800 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-02-25 15:53:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:10,802 INFO L225 Difference]: With dead ends: 183 [2019-02-25 15:53:10,802 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:53:10,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:53:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:53:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-25 15:53:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:53:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-25 15:53:10,807 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-02-25 15:53:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:10,808 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-25 15:53:10,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-25 15:53:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-25 15:53:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:53:10,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:10,809 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-02-25 15:53:10,809 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-02-25 15:53:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:10,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:12,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:12,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:12,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:13,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-25 15:53:13,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:13,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-25 15:53:13,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:13,220 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:13,220 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,229 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,229 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:15,238 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:18,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:18,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-25 15:53:18,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:18,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-25 15:53:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-25 15:53:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:53:18,973 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-02-25 15:53:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:19,393 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-02-25 15:53:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:53:19,393 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-02-25 15:53:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:19,395 INFO L225 Difference]: With dead ends: 186 [2019-02-25 15:53:19,395 INFO L226 Difference]: Without dead ends: 185 [2019-02-25 15:53:19,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:53:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-25 15:53:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-02-25 15:53:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-02-25 15:53:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-02-25 15:53:19,401 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-02-25 15:53:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:19,402 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-02-25 15:53:19,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-25 15:53:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-02-25 15:53:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-02-25 15:53:19,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:19,403 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-02-25 15:53:19,403 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-02-25 15:53:19,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:19,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:19,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:19,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:21,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:21,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:21,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:21,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:21,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:21,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:21,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:21,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:21,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:21,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-25 15:53:21,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:21,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:21,407 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:21,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:23,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:27,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:27,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-25 15:53:27,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:27,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-25 15:53:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-25 15:53:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:53:27,332 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-02-25 15:53:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:27,777 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-02-25 15:53:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:53:27,778 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-02-25 15:53:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:27,779 INFO L225 Difference]: With dead ends: 189 [2019-02-25 15:53:27,779 INFO L226 Difference]: Without dead ends: 188 [2019-02-25 15:53:27,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:53:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-25 15:53:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-02-25 15:53:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:53:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-02-25 15:53:27,783 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-02-25 15:53:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:27,783 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-02-25 15:53:27,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-25 15:53:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-02-25 15:53:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-25 15:53:27,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:27,784 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-02-25 15:53:27,784 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:27,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-02-25 15:53:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:27,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:27,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:27,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:29,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:29,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:29,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:29,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:29,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:29,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:29,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:29,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:29,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 193 conjunts are in the unsatisfiable core [2019-02-25 15:53:29,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:29,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:29,640 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,650 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,650 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:32,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:35,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-25 15:53:35,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:35,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-25 15:53:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-25 15:53:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:53:35,639 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-02-25 15:53:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:36,257 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-02-25 15:53:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:53:36,258 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-02-25 15:53:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:36,259 INFO L225 Difference]: With dead ends: 192 [2019-02-25 15:53:36,259 INFO L226 Difference]: Without dead ends: 191 [2019-02-25 15:53:36,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:53:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-25 15:53:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-02-25 15:53:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-02-25 15:53:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-02-25 15:53:36,265 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-02-25 15:53:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:36,265 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-02-25 15:53:36,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-25 15:53:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-02-25 15:53:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-02-25 15:53:36,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:36,266 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-02-25 15:53:36,266 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-02-25 15:53:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:36,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:38,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:38,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:38,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:38,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:38,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:38,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:38,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-25 15:53:38,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:38,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-25 15:53:38,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:38,508 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:38,508 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,516 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,516 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:40,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:44,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:44,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-25 15:53:44,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:44,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-25 15:53:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-25 15:53:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:53:44,541 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-02-25 15:53:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:45,024 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-25 15:53:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:53:45,024 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-02-25 15:53:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:45,026 INFO L225 Difference]: With dead ends: 195 [2019-02-25 15:53:45,026 INFO L226 Difference]: Without dead ends: 194 [2019-02-25 15:53:45,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:53:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-25 15:53:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-25 15:53:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:53:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-25 15:53:45,031 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-02-25 15:53:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:45,031 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-25 15:53:45,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-25 15:53:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-25 15:53:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:53:45,032 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:45,032 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-02-25 15:53:45,032 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-02-25 15:53:45,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:45,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:45,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:45,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:47,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:47,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:47,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:47,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:47,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:47,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:47,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:47,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:47,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-25 15:53:47,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:47,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:47,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,322 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,322 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:49,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:53,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:53,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-25 15:53:53,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:53,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-25 15:53:53,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-25 15:53:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:53:53,713 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-02-25 15:53:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:54,229 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-02-25 15:53:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:53:54,229 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-02-25 15:53:54,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:54,230 INFO L225 Difference]: With dead ends: 198 [2019-02-25 15:53:54,230 INFO L226 Difference]: Without dead ends: 197 [2019-02-25 15:53:54,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:53:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-25 15:53:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-02-25 15:53:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-25 15:53:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-25 15:53:54,237 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-02-25 15:53:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:54,237 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-25 15:53:54,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-25 15:53:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-25 15:53:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-25 15:53:54,239 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:54,239 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-02-25 15:53:54,239 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-02-25 15:53:54,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:54,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:54,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:54,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:56,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:56,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:56,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:56,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:56,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:56,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:56,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:56,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-25 15:53:56,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:56,205 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:53:56,206 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,223 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:56,223 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:53:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:58,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:02,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-25 15:54:02,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-25 15:54:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-25 15:54:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:54:02,554 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-02-25 15:54:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:03,008 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-02-25 15:54:03,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:54:03,008 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-02-25 15:54:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:03,010 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:54:03,010 INFO L226 Difference]: Without dead ends: 200 [2019-02-25 15:54:03,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:54:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-25 15:54:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-02-25 15:54:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:54:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-02-25 15:54:03,017 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-02-25 15:54:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:03,017 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-02-25 15:54:03,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-25 15:54:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-02-25 15:54:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:54:03,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:03,019 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-02-25 15:54:03,019 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:03,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-02-25 15:54:03,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:03,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:03,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:03,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:03,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:05,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:05,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:05,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:05,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:05,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:05,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:05,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:05,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:05,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-25 15:54:05,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:05,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-25 15:54:05,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:05,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:05,407 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,417 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,418 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:08,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:11,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:11,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-25 15:54:11,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:11,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-25 15:54:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-25 15:54:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:54:11,715 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-02-25 15:54:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:12,256 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-02-25 15:54:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:54:12,256 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-02-25 15:54:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:12,258 INFO L225 Difference]: With dead ends: 204 [2019-02-25 15:54:12,258 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:54:12,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:54:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:54:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-25 15:54:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-25 15:54:12,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-02-25 15:54:12,265 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-02-25 15:54:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:12,265 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-02-25 15:54:12,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-25 15:54:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-02-25 15:54:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-02-25 15:54:12,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:12,266 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-02-25 15:54:12,267 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-02-25 15:54:12,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:12,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:12,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:12,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:12,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:14,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:14,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:14,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:14,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:14,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:54:14,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:54:14,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:54:14,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:14,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-25 15:54:14,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:14,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:14,358 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:14,367 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:14,367 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:16,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:20,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-25 15:54:20,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:20,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-25 15:54:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-25 15:54:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:54:20,713 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-02-25 15:54:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:21,235 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-25 15:54:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:54:21,236 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-02-25 15:54:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:21,237 INFO L225 Difference]: With dead ends: 207 [2019-02-25 15:54:21,237 INFO L226 Difference]: Without dead ends: 206 [2019-02-25 15:54:21,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:54:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-25 15:54:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-25 15:54:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:54:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-25 15:54:21,241 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-02-25 15:54:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:21,242 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-25 15:54:21,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-25 15:54:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-25 15:54:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:54:21,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:21,243 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-02-25 15:54:21,243 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-02-25 15:54:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:21,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:21,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:23,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:23,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:23,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:23,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:23,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:23,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:23,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:23,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:23,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 211 conjunts are in the unsatisfiable core [2019-02-25 15:54:23,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:23,532 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:23,532 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,540 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,540 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:26,113 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:29,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:29,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-25 15:54:29,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:29,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-25 15:54:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-25 15:54:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:54:29,825 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-02-25 15:54:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:30,246 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-25 15:54:30,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:54:30,247 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-02-25 15:54:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:30,248 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:54:30,248 INFO L226 Difference]: Without dead ends: 209 [2019-02-25 15:54:30,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:54:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-25 15:54:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-02-25 15:54:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-02-25 15:54:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-02-25 15:54:30,254 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-02-25 15:54:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:30,254 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-02-25 15:54:30,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-25 15:54:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-02-25 15:54:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-02-25 15:54:30,255 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:30,255 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-02-25 15:54:30,255 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:30,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-02-25 15:54:30,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:30,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:30,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:30,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:32,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:32,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:32,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:32,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:32,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:32,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:32,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:32,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-25 15:54:32,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:32,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-25 15:54:32,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:32,817 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:32,817 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:32,833 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:32,834 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:35,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:39,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:39,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-25 15:54:39,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-25 15:54:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-25 15:54:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:54:39,221 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-02-25 15:54:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:39,783 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-02-25 15:54:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:54:39,783 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-02-25 15:54:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:39,785 INFO L225 Difference]: With dead ends: 213 [2019-02-25 15:54:39,785 INFO L226 Difference]: Without dead ends: 212 [2019-02-25 15:54:39,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:54:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-25 15:54:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-02-25 15:54:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-25 15:54:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-25 15:54:39,791 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-02-25 15:54:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:39,792 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-25 15:54:39,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-25 15:54:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-25 15:54:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-25 15:54:39,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:39,793 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-02-25 15:54:39,793 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-02-25 15:54:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:39,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:39,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:39,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:42,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:42,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:42,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:42,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:42,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:42,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:42,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:54:42,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:54:42,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:54:42,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:42,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-25 15:54:42,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:42,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:42,104 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:42,115 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:42,115 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:44,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:48,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-25 15:54:48,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:48,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-25 15:54:48,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-25 15:54:48,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:54:48,771 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-02-25 15:54:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:49,262 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-02-25 15:54:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:54:49,263 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-02-25 15:54:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:49,264 INFO L225 Difference]: With dead ends: 216 [2019-02-25 15:54:49,264 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:54:49,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:54:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:54:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-02-25 15:54:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-25 15:54:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-02-25 15:54:49,271 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-02-25 15:54:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:49,272 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-02-25 15:54:49,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-25 15:54:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-02-25 15:54:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-02-25 15:54:49,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:49,273 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-02-25 15:54:49,273 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-02-25 15:54:49,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:49,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:49,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:51,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:51,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:51,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:51,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:51,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:51,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:51,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:51,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:51,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 220 conjunts are in the unsatisfiable core [2019-02-25 15:54:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:51,667 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:54:51,667 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,681 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,681 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:54:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:54,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:58,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:58,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-25 15:54:58,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:58,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-25 15:54:58,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-25 15:54:58,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:54:58,561 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-02-25 15:54:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:59,050 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-25 15:54:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:54:59,050 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-02-25 15:54:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:59,052 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:54:59,052 INFO L226 Difference]: Without dead ends: 218 [2019-02-25 15:54:59,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:54:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-25 15:54:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-25 15:54:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:54:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-25 15:54:59,057 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-02-25 15:54:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:59,057 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-25 15:54:59,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-25 15:54:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-25 15:54:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:54:59,058 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:59,058 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-02-25 15:54:59,059 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-02-25 15:54:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:01,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:01,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:01,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:01,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:01,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:01,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:01,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-25 15:55:01,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:01,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-25 15:55:01,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:01,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:01,724 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,732 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,732 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:04,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-25 15:55:08,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:08,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-25 15:55:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-25 15:55:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:55:08,603 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-02-25 15:55:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:09,106 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-02-25 15:55:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:55:09,106 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-02-25 15:55:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:09,108 INFO L225 Difference]: With dead ends: 222 [2019-02-25 15:55:09,108 INFO L226 Difference]: Without dead ends: 221 [2019-02-25 15:55:09,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:55:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-02-25 15:55:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-02-25 15:55:09,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-25 15:55:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-02-25 15:55:09,114 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-02-25 15:55:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:09,114 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-02-25 15:55:09,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-25 15:55:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-02-25 15:55:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-25 15:55:09,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:09,115 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-02-25 15:55:09,115 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-02-25 15:55:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:09,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:11,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:11,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:11,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:11,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:11,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:55:11,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:55:11,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:55:11,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:11,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-25 15:55:11,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:11,570 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:11,570 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,579 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,579 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:14,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:18,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:18,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-25 15:55:18,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-25 15:55:18,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-25 15:55:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:55:18,535 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-02-25 15:55:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:19,071 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-25 15:55:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:55:19,071 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-02-25 15:55:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:19,073 INFO L225 Difference]: With dead ends: 225 [2019-02-25 15:55:19,073 INFO L226 Difference]: Without dead ends: 224 [2019-02-25 15:55:19,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:55:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-25 15:55:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-02-25 15:55:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-02-25 15:55:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-02-25 15:55:19,079 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-02-25 15:55:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:19,079 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-02-25 15:55:19,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-25 15:55:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-02-25 15:55:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-02-25 15:55:19,080 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:19,080 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-02-25 15:55:19,080 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-02-25 15:55:19,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:19,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:19,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:19,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:21,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:21,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:21,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:21,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:21,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:21,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 229 conjunts are in the unsatisfiable core [2019-02-25 15:55:21,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:21,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:21,621 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,630 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:21,630 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:24,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:28,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:28,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-25 15:55:28,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:28,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-25 15:55:28,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-25 15:55:28,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:55:28,551 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-02-25 15:55:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:29,151 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-02-25 15:55:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:55:29,151 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-02-25 15:55:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:29,153 INFO L225 Difference]: With dead ends: 228 [2019-02-25 15:55:29,153 INFO L226 Difference]: Without dead ends: 227 [2019-02-25 15:55:29,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:55:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-25 15:55:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-25 15:55:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-25 15:55:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-25 15:55:29,158 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-02-25 15:55:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:29,159 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-25 15:55:29,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-25 15:55:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-25 15:55:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-25 15:55:29,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:29,160 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-02-25 15:55:29,160 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-02-25 15:55:29,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:29,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:31,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:31,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:31,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:31,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:31,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:31,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:31,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-25 15:55:31,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:31,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-25 15:55:31,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:31,972 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:31,972 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,981 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,982 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:35,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-25 15:55:39,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:39,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-25 15:55:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-25 15:55:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:55:39,021 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-02-25 15:55:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:39,623 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-25 15:55:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:55:39,624 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-02-25 15:55:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:39,625 INFO L225 Difference]: With dead ends: 231 [2019-02-25 15:55:39,626 INFO L226 Difference]: Without dead ends: 230 [2019-02-25 15:55:39,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:55:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-25 15:55:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-25 15:55:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-25 15:55:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-25 15:55:39,633 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-02-25 15:55:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:39,633 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-25 15:55:39,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-25 15:55:39,633 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-25 15:55:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-25 15:55:39,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:39,635 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-02-25 15:55:39,635 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-02-25 15:55:39,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:39,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:39,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:39,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:42,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:42,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:42,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:42,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:42,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:42,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:42,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:55:42,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:55:42,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:55:42,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:42,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-25 15:55:42,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:42,359 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:42,359 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,365 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,365 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:45,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:49,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-25 15:55:49,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:49,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-25 15:55:49,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-25 15:55:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:55:49,426 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-02-25 15:55:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:50,070 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-02-25 15:55:50,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:55:50,071 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-02-25 15:55:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:50,072 INFO L225 Difference]: With dead ends: 234 [2019-02-25 15:55:50,073 INFO L226 Difference]: Without dead ends: 233 [2019-02-25 15:55:50,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:55:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-02-25 15:55:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-02-25 15:55:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-02-25 15:55:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-02-25 15:55:50,080 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-02-25 15:55:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:50,080 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-02-25 15:55:50,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-25 15:55:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-02-25 15:55:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-02-25 15:55:50,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:50,081 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-02-25 15:55:50,081 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-02-25 15:55:50,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:50,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:50,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:50,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:50,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:52,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:52,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:52,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:52,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:52,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:52,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:52,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:52,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:52,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 238 conjunts are in the unsatisfiable core [2019-02-25 15:55:52,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:52,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:55:52,860 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,877 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,878 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:55:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:56,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:59,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:59,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-25 15:55:59,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:59,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-25 15:55:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-25 15:55:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:55:59,921 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-02-25 15:56:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:00,501 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-02-25 15:56:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:56:00,501 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-02-25 15:56:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:00,502 INFO L225 Difference]: With dead ends: 237 [2019-02-25 15:56:00,502 INFO L226 Difference]: Without dead ends: 236 [2019-02-25 15:56:00,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:56:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-25 15:56:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-02-25 15:56:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-25 15:56:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-02-25 15:56:00,508 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-02-25 15:56:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:00,509 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-02-25 15:56:00,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-25 15:56:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-02-25 15:56:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-02-25 15:56:00,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:00,510 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-02-25 15:56:00,510 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:00,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-02-25 15:56:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:00,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:00,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:00,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:03,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:03,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:03,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:03,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:03,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:03,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:03,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:56:03,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:56:03,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-25 15:56:03,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:03,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-25 15:56:03,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:03,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:03,652 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:03,661 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:03,661 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:06,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:10,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:10,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-25 15:56:10,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:10,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-25 15:56:10,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-25 15:56:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:56:10,881 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-02-25 15:56:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:11,541 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-25 15:56:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:56:11,542 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-02-25 15:56:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:11,543 INFO L225 Difference]: With dead ends: 240 [2019-02-25 15:56:11,543 INFO L226 Difference]: Without dead ends: 239 [2019-02-25 15:56:11,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:56:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-25 15:56:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-02-25 15:56:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-25 15:56:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-02-25 15:56:11,548 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-02-25 15:56:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:11,548 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-02-25 15:56:11,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-25 15:56:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-02-25 15:56:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-02-25 15:56:11,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:11,549 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-02-25 15:56:11,550 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-02-25 15:56:11,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:11,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:11,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:14,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:14,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:14,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:14,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:14,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:14,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:56:14,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:56:14,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:56:14,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:14,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-25 15:56:14,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:14,372 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:14,372 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:14,384 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:14,384 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:17,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:21,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:21,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-25 15:56:21,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:21,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-25 15:56:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-25 15:56:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:56:21,647 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-02-25 15:56:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:22,241 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-25 15:56:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:56:22,242 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-02-25 15:56:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:22,244 INFO L225 Difference]: With dead ends: 243 [2019-02-25 15:56:22,244 INFO L226 Difference]: Without dead ends: 242 [2019-02-25 15:56:22,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:56:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-25 15:56:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-25 15:56:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:56:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-25 15:56:22,251 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-02-25 15:56:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:22,251 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-25 15:56:22,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-25 15:56:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-25 15:56:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:56:22,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:22,252 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-02-25 15:56:22,252 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-02-25 15:56:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:22,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:22,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:22,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:22,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:25,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:25,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:25,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:25,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:25,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:25,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:25,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 247 conjunts are in the unsatisfiable core [2019-02-25 15:56:25,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:25,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:25,352 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:25,362 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:25,362 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:28,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:32,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:32,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-25 15:56:32,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:32,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-25 15:56:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-25 15:56:32,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:56:32,811 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-02-25 15:56:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:33,403 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-02-25 15:56:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:56:33,403 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-02-25 15:56:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:33,404 INFO L225 Difference]: With dead ends: 246 [2019-02-25 15:56:33,404 INFO L226 Difference]: Without dead ends: 245 [2019-02-25 15:56:33,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:56:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-25 15:56:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-02-25 15:56:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-02-25 15:56:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-02-25 15:56:33,411 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-02-25 15:56:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:33,412 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-02-25 15:56:33,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-25 15:56:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-02-25 15:56:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-02-25 15:56:33,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:33,413 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-02-25 15:56:33,413 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:33,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-02-25 15:56:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:33,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:33,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:33,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:36,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:36,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:36,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:36,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:56:36,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:56:36,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-25 15:56:36,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:36,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-25 15:56:36,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:36,727 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:36,727 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:36,736 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:36,736 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:40,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:44,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:44,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-25 15:56:44,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:44,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-25 15:56:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-25 15:56:44,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:56:44,224 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-02-25 15:56:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:44,803 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-02-25 15:56:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:56:44,803 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-02-25 15:56:44,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:44,804 INFO L225 Difference]: With dead ends: 249 [2019-02-25 15:56:44,805 INFO L226 Difference]: Without dead ends: 248 [2019-02-25 15:56:44,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:56:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-25 15:56:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-02-25 15:56:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-25 15:56:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-02-25 15:56:44,809 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-02-25 15:56:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:44,810 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-02-25 15:56:44,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-25 15:56:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-02-25 15:56:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-02-25 15:56:44,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:44,811 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-02-25 15:56:44,811 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-02-25 15:56:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:44,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:44,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:47,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:47,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:47,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:47,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:47,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:47,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:56:47,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:56:47,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:56:47,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:56:47,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-25 15:56:47,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:47,820 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:47,821 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,830 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,830 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:56:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:51,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:55,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:55,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-25 15:56:55,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:55,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-25 15:56:55,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-25 15:56:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:56:55,445 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-02-25 15:56:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:56,078 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-02-25 15:56:56,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:56:56,079 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-02-25 15:56:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:56,080 INFO L225 Difference]: With dead ends: 252 [2019-02-25 15:56:56,080 INFO L226 Difference]: Without dead ends: 251 [2019-02-25 15:56:56,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:56:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-25 15:56:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-02-25 15:56:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-25 15:56:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-02-25 15:56:56,085 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-02-25 15:56:56,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:56,085 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-02-25 15:56:56,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-25 15:56:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-02-25 15:56:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-02-25 15:56:56,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:56,086 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-02-25 15:56:56,086 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-02-25 15:56:56,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:56,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:56:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:56,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:56:59,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:59,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:59,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:56:59,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:56:59,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:59,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:59,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:59,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:59,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 256 conjunts are in the unsatisfiable core [2019-02-25 15:56:59,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:59,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:56:59,164 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:59,174 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:59,174 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:02,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:06,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:06,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-25 15:57:06,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:06,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-25 15:57:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-25 15:57:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:57:06,928 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-02-25 15:57:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:07,530 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-25 15:57:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:57:07,530 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-02-25 15:57:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:07,532 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:57:07,532 INFO L226 Difference]: Without dead ends: 254 [2019-02-25 15:57:07,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:57:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-25 15:57:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-25 15:57:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-25 15:57:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-25 15:57:07,537 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-02-25 15:57:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:07,537 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-25 15:57:07,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-25 15:57:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-25 15:57:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-25 15:57:07,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:07,539 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-02-25 15:57:07,539 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:07,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:07,539 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-02-25 15:57:07,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:07,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:10,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:10,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:10,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:10,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:10,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:10,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:57:10,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:57:11,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-25 15:57:11,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:11,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-25 15:57:11,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:11,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:11,059 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:11,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:11,065 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:14,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:18,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-25 15:57:18,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:18,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-25 15:57:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-25 15:57:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:57:18,888 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-02-25 15:57:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:19,507 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-02-25 15:57:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:57:19,507 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-02-25 15:57:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:19,509 INFO L225 Difference]: With dead ends: 258 [2019-02-25 15:57:19,509 INFO L226 Difference]: Without dead ends: 257 [2019-02-25 15:57:19,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:57:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-02-25 15:57:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-02-25 15:57:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-25 15:57:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-25 15:57:19,515 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-02-25 15:57:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:19,515 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-25 15:57:19,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-25 15:57:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-25 15:57:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-25 15:57:19,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:19,516 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-02-25 15:57:19,516 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-02-25 15:57:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:19,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:19,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:19,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:22,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:22,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:22,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:22,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:22,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:22,686 INFO 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-02-25 15:57:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:57:22,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:57:22,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:57:22,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:22,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-25 15:57:22,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:22,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:22,788 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:22,799 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:22,799 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:26,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-25 15:57:30,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:30,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-25 15:57:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-25 15:57:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:57:30,662 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-02-25 15:57:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:31,343 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-02-25 15:57:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:57:31,344 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-02-25 15:57:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:31,346 INFO L225 Difference]: With dead ends: 261 [2019-02-25 15:57:31,346 INFO L226 Difference]: Without dead ends: 260 [2019-02-25 15:57:31,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:57:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-02-25 15:57:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-02-25 15:57:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-25 15:57:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-02-25 15:57:31,353 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-02-25 15:57:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:31,353 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-02-25 15:57:31,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-25 15:57:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-02-25 15:57:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-25 15:57:31,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:31,355 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-02-25 15:57:31,355 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-02-25 15:57:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:31,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:31,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:34,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:34,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:34,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:34,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:34,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:34,615 INFO 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-02-25 15:57:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:34,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:34,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 265 conjunts are in the unsatisfiable core [2019-02-25 15:57:34,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:34,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:34,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:34,723 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:34,724 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:38,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:42,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:42,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-25 15:57:42,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:42,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-25 15:57:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-25 15:57:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:57:42,640 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-02-25 15:57:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:43,363 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-02-25 15:57:43,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:57:43,364 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-02-25 15:57:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:43,365 INFO L225 Difference]: With dead ends: 264 [2019-02-25 15:57:43,365 INFO L226 Difference]: Without dead ends: 263 [2019-02-25 15:57:43,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:57:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-02-25 15:57:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-02-25 15:57:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-25 15:57:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-02-25 15:57:43,373 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-02-25 15:57:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:43,373 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-02-25 15:57:43,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-25 15:57:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-02-25 15:57:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-25 15:57:43,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:43,375 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-02-25 15:57:43,375 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-02-25 15:57:43,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:43,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:43,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:46,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:46,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:46,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:46,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:46,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:46,693 INFO 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-02-25 15:57:46,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:57:46,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:57:47,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-25 15:57:47,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:47,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-25 15:57:47,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:47,175 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:47,175 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,186 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,187 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:57:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:51,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:55,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-25 15:57:55,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:55,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-25 15:57:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-25 15:57:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:57:55,165 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-02-25 15:57:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:55,866 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-25 15:57:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:57:55,867 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-02-25 15:57:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:55,868 INFO L225 Difference]: With dead ends: 267 [2019-02-25 15:57:55,868 INFO L226 Difference]: Without dead ends: 266 [2019-02-25 15:57:55,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:57:55,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-25 15:57:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-25 15:57:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-25 15:57:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-25 15:57:55,875 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-02-25 15:57:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:55,875 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-25 15:57:55,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-25 15:57:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-25 15:57:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-25 15:57:55,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:55,876 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-02-25 15:57:55,876 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-02-25 15:57:55,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:55,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:57:55,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:55,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:57:59,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:59,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:59,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:57:59,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:57:59,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:59,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:57:59,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:57:59,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:57:59,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:57:59,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-25 15:57:59,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:59,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:57:59,396 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:59,410 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:59,410 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:03,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:07,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-25 15:58:07,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:07,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-25 15:58:07,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-25 15:58:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:58:07,527 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-02-25 15:58:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:08,186 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-25 15:58:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:58:08,187 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-02-25 15:58:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:08,188 INFO L225 Difference]: With dead ends: 270 [2019-02-25 15:58:08,189 INFO L226 Difference]: Without dead ends: 269 [2019-02-25 15:58:08,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:58:08,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-25 15:58:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-02-25 15:58:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-02-25 15:58:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-02-25 15:58:08,195 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-02-25 15:58:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:08,195 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-02-25 15:58:08,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-25 15:58:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-02-25 15:58:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-02-25 15:58:08,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:08,196 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-02-25 15:58:08,196 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-02-25 15:58:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:08,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:08,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:11,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:11,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:11,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:11,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:11,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:11,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:11,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:11,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 274 conjunts are in the unsatisfiable core [2019-02-25 15:58:11,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:11,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:11,804 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:11,812 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:11,813 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:16,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:20,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-25 15:58:20,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:20,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-25 15:58:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-25 15:58:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:58:20,088 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-02-25 15:58:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:20,884 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-02-25 15:58:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:58:20,885 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-02-25 15:58:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:20,887 INFO L225 Difference]: With dead ends: 273 [2019-02-25 15:58:20,887 INFO L226 Difference]: Without dead ends: 272 [2019-02-25 15:58:20,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:58:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-25 15:58:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-02-25 15:58:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-25 15:58:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-25 15:58:20,893 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-02-25 15:58:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:20,893 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-25 15:58:20,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-25 15:58:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-25 15:58:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-25 15:58:20,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:20,894 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-02-25 15:58:20,894 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-02-25 15:58:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:20,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:20,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:24,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:24,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:24,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:24,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:24,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:58:24,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:58:24,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-25 15:58:24,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:25,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-25 15:58:25,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:25,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:25,010 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:25,021 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:25,021 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:29,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:33,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:33,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-25 15:58:33,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:33,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-25 15:58:33,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-25 15:58:33,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:58:33,452 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-02-25 15:58:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:34,217 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-02-25 15:58:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:58:34,217 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-02-25 15:58:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:34,219 INFO L225 Difference]: With dead ends: 276 [2019-02-25 15:58:34,219 INFO L226 Difference]: Without dead ends: 275 [2019-02-25 15:58:34,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:58:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-25 15:58:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-02-25 15:58:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-25 15:58:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-02-25 15:58:34,226 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-02-25 15:58:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:34,226 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-02-25 15:58:34,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-25 15:58:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-02-25 15:58:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-02-25 15:58:34,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:34,227 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-02-25 15:58:34,227 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-02-25 15:58:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:34,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:34,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:34,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:34,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:37,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:37,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:37,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:37,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:37,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:37,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:37,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:58:37,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:58:37,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:58:37,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:37,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 280 conjunts are in the unsatisfiable core [2019-02-25 15:58:37,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:37,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:37,939 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:37,947 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:37,948 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:42,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:46,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:46,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-25 15:58:46,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:46,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-25 15:58:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-25 15:58:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:58:46,421 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-02-25 15:58:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:47,159 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-25 15:58:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:58:47,159 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-02-25 15:58:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:47,161 INFO L225 Difference]: With dead ends: 279 [2019-02-25 15:58:47,161 INFO L226 Difference]: Without dead ends: 278 [2019-02-25 15:58:47,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:58:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-25 15:58:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-25 15:58:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-25 15:58:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-25 15:58:47,166 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-02-25 15:58:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:47,166 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-25 15:58:47,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-25 15:58:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-25 15:58:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-25 15:58:47,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:47,167 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-02-25 15:58:47,167 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:47,168 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-02-25 15:58:47,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:47,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:47,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:47,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:50,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:50,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:50,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:50,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:50,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:50,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:50,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:50,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 283 conjunts are in the unsatisfiable core [2019-02-25 15:58:50,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:50,944 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:58:50,944 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:50,955 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:50,955 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:58:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:55,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-25 15:58:59,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:59,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-25 15:58:59,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-25 15:58:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:58:59,455 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-02-25 15:59:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:00,165 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-02-25 15:59:00,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:59:00,167 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-02-25 15:59:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:00,169 INFO L225 Difference]: With dead ends: 282 [2019-02-25 15:59:00,169 INFO L226 Difference]: Without dead ends: 281 [2019-02-25 15:59:00,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:59:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-25 15:59:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-02-25 15:59:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-02-25 15:59:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-02-25 15:59:00,176 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-02-25 15:59:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:00,176 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-02-25 15:59:00,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-25 15:59:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-02-25 15:59:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-02-25 15:59:00,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:00,177 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-02-25 15:59:00,177 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-02-25 15:59:00,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:00,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:00,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:04,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:04,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:04,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:04,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:59:04,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:04,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:04,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:59:04,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:59:05,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-25 15:59:05,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:59:05,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 286 conjunts are in the unsatisfiable core [2019-02-25 15:59:05,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:05,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:05,187 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,195 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,196 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:09,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-25 15:59:13,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:13,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-25 15:59:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-25 15:59:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:59:13,879 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-02-25 15:59:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:14,694 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-25 15:59:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:59:14,695 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-02-25 15:59:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:14,697 INFO L225 Difference]: With dead ends: 285 [2019-02-25 15:59:14,697 INFO L226 Difference]: Without dead ends: 284 [2019-02-25 15:59:14,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:59:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-25 15:59:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-02-25 15:59:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-25 15:59:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-02-25 15:59:14,703 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-02-25 15:59:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:14,703 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-02-25 15:59:14,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-25 15:59:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-02-25 15:59:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-02-25 15:59:14,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:14,705 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-02-25 15:59:14,705 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-02-25 15:59:14,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:14,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:14,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:14,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:18,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:18,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:18,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:18,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:59:18,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:18,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:59:18,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:59:18,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:59:18,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:59:18,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 289 conjunts are in the unsatisfiable core [2019-02-25 15:59:18,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:18,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:18,652 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:18,661 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:18,662 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:23,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-25 15:59:27,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:27,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-25 15:59:27,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-25 15:59:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:59:27,568 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-02-25 15:59:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:28,373 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-02-25 15:59:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:59:28,374 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-02-25 15:59:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:28,375 INFO L225 Difference]: With dead ends: 288 [2019-02-25 15:59:28,376 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:59:28,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:59:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:59:28,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-02-25 15:59:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-25 15:59:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-25 15:59:28,382 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-02-25 15:59:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:28,382 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-25 15:59:28,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-25 15:59:28,382 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-25 15:59:28,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-25 15:59:28,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:28,383 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-02-25 15:59:28,383 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-02-25 15:59:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:28,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:28,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:32,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:32,314 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:32,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:59:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:32,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:32,323 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:32,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 292 conjunts are in the unsatisfiable core [2019-02-25 15:59:32,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:32,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:32,417 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:32,425 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:32,425 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:37,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:41,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:41,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-25 15:59:41,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:41,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-25 15:59:41,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-25 15:59:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:59:41,345 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-02-25 15:59:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:42,087 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-25 15:59:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:59:42,087 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-02-25 15:59:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:42,089 INFO L225 Difference]: With dead ends: 291 [2019-02-25 15:59:42,090 INFO L226 Difference]: Without dead ends: 290 [2019-02-25 15:59:42,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:59:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-25 15:59:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-25 15:59:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-25 15:59:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-25 15:59:42,097 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-02-25 15:59:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:42,097 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-25 15:59:42,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-25 15:59:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-25 15:59:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-25 15:59:42,098 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:42,099 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-02-25 15:59:42,099 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-02-25 15:59:42,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:42,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:42,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:42,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:42,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:46,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:46,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:46,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:59:46,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:59:46,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:46,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:46,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:59:46,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:59:46,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-25 15:59:46,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:59:46,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 295 conjunts are in the unsatisfiable core [2019-02-25 15:59:46,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:46,756 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 15:59:46,756 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,763 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:46,764 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:59:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:51,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:59:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-25 15:59:55,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:55,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-25 15:59:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-25 15:59:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:59:55,831 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-02-25 15:59:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:56,666 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-02-25 15:59:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:59:56,666 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-02-25 15:59:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:56,668 INFO L225 Difference]: With dead ends: 294 [2019-02-25 15:59:56,668 INFO L226 Difference]: Without dead ends: 293 [2019-02-25 15:59:56,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:59:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-02-25 15:59:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-02-25 15:59:56,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-02-25 15:59:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-02-25 15:59:56,675 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-02-25 15:59:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:56,675 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-02-25 15:59:56,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-25 15:59:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-02-25 15:59:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-02-25 15:59:56,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:56,677 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-02-25 15:59:56,677 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-02-25 15:59:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:56,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:59:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:56,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:00,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:00,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:00,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:00,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:00,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:00,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:00,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 16:00:00,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 16:00:00,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 16:00:00,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:00,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 298 conjunts are in the unsatisfiable core [2019-02-25 16:00:00,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:00,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:00,930 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:00,941 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:00,941 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:05,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:10,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:10,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-25 16:00:10,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:10,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-25 16:00:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-25 16:00:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 16:00:10,042 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-02-25 16:00:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:10,778 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-02-25 16:00:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 16:00:10,778 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-02-25 16:00:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:10,781 INFO L225 Difference]: With dead ends: 297 [2019-02-25 16:00:10,781 INFO L226 Difference]: Without dead ends: 296 [2019-02-25 16:00:10,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 16:00:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-02-25 16:00:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-02-25 16:00:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-02-25 16:00:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-02-25 16:00:10,789 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-02-25 16:00:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:10,789 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-02-25 16:00:10,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-25 16:00:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-02-25 16:00:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-02-25 16:00:10,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:10,791 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-02-25 16:00:10,791 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-02-25 16:00:10,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:10,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:00:10,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:10,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:14,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:14,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:14,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:14,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:14,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:14,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:14,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:15,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 301 conjunts are in the unsatisfiable core [2019-02-25 16:00:15,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:15,071 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:15,071 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:15,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:15,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:20,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:24,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:24,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-25 16:00:24,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-25 16:00:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-25 16:00:24,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 16:00:24,321 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-02-25 16:00:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:25,140 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-25 16:00:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 16:00:25,141 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-02-25 16:00:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:25,142 INFO L225 Difference]: With dead ends: 300 [2019-02-25 16:00:25,142 INFO L226 Difference]: Without dead ends: 299 [2019-02-25 16:00:25,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 16:00:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-25 16:00:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-02-25 16:00:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-02-25 16:00:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-02-25 16:00:25,148 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-02-25 16:00:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:25,148 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-02-25 16:00:25,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-25 16:00:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-02-25 16:00:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-02-25 16:00:25,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:25,149 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-02-25 16:00:25,149 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-02-25 16:00:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:25,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:25,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:29,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:29,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:29,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:29,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:29,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:29,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:29,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:00:29,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:00:30,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-25 16:00:30,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:30,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 304 conjunts are in the unsatisfiable core [2019-02-25 16:00:30,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:30,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:30,527 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:30,540 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:30,540 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:35,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:39,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:39,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-25 16:00:39,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:39,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-25 16:00:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-25 16:00:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 16:00:39,940 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-02-25 16:00:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:40,828 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-25 16:00:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 16:00:40,829 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-02-25 16:00:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:40,831 INFO L225 Difference]: With dead ends: 303 [2019-02-25 16:00:40,831 INFO L226 Difference]: Without dead ends: 302 [2019-02-25 16:00:40,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 16:00:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-25 16:00:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-25 16:00:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-25 16:00:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-25 16:00:40,838 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-02-25 16:00:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:40,838 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-25 16:00:40,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-25 16:00:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-25 16:00:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-25 16:00:40,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:40,840 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-02-25 16:00:40,840 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-02-25 16:00:40,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:40,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:00:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:40,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:45,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:45,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:45,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:45,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:45,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:45,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:45,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 16:00:45,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 16:00:45,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 16:00:45,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:00:45,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 307 conjunts are in the unsatisfiable core [2019-02-25 16:00:45,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:45,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-25 16:00:45,324 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:45,328 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:45,329 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 16:00:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:50,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:54,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:54,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-25 16:00:54,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:54,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-25 16:00:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-25 16:00:54,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 16:00:54,650 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-02-25 16:00:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:55,455 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-25 16:00:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 16:00:55,455 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-02-25 16:00:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:55,457 INFO L225 Difference]: With dead ends: 306 [2019-02-25 16:00:55,457 INFO L226 Difference]: Without dead ends: 305 [2019-02-25 16:00:55,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 16:00:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-02-25 16:00:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-02-25 16:00:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 16:00:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-02-25 16:00:55,463 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-02-25 16:00:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:55,463 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-02-25 16:00:55,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-25 16:00:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-02-25 16:00:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-02-25 16:00:55,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:55,465 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-02-25 16:00:55,465 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-02-25 16:00:55,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:55,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:00:55,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:55,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:59,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:59,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:00:59,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:00:59,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:59,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:59,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:59,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:59,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 16:00:59,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:00:59,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-25 16:01:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2019-02-25 16:01:03,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 16:01:03,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 16:01:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 16:01:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 16:01:03,810 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-02-25 16:01:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:04,538 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-25 16:01:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 16:01:04,538 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-02-25 16:01:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:04,539 INFO L225 Difference]: With dead ends: 306 [2019-02-25 16:01:04,540 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 16:01:04,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 16:01:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 16:01:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 16:01:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 16:01:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 16:01:04,543 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-02-25 16:01:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:04,543 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 16:01:04,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 16:01:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 16:01:04,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 16:01:04,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 16:01:04,671 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-02-25 16:01:07,866 WARN L181 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-25 16:01:07,872 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-02-25 16:01:07,872 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-02-25 16:01:07,873 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-02-25 16:01:07,873 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-02-25 16:01:07,873 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-02-25 16:01:07,875 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-25 16:01:07,875 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-02-25 16:01:07,917 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 04:01:07 BoogieIcfgContainer [2019-02-25 16:01:07,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 16:01:07,918 INFO L168 Benchmark]: Toolchain (without parser) took 695562.65 ms. Allocated memory was 142.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 110.2 MB in the beginning and 1.1 GB in the end (delta: -948.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-02-25 16:01:07,919 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 16:01:07,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.37 ms. Allocated memory is still 142.6 MB. Free memory was 110.0 MB in the beginning and 107.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:07,919 INFO L168 Benchmark]: Boogie Preprocessor took 24.65 ms. Allocated memory is still 142.6 MB. Free memory was 107.8 MB in the beginning and 106.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:07,920 INFO L168 Benchmark]: RCFGBuilder took 346.88 ms. Allocated memory is still 142.6 MB. Free memory was 106.5 MB in the beginning and 96.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-25 16:01:07,920 INFO L168 Benchmark]: TraceAbstraction took 695133.85 ms. Allocated memory was 142.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 96.3 MB in the beginning and 1.1 GB in the end (delta: -962.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-02-25 16:01:07,922 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.6 MB. Free memory is still 111.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.37 ms. Allocated memory is still 142.6 MB. Free memory was 110.0 MB in the beginning and 107.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.65 ms. Allocated memory is still 142.6 MB. Free memory was 107.8 MB in the beginning and 106.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.88 ms. Allocated memory is still 142.6 MB. Free memory was 106.5 MB in the beginning and 96.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 695133.85 ms. Allocated memory was 142.6 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 96.3 MB in the beginning and 1.1 GB in the end (delta: -962.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 695.0s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 598.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 622.4s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...