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-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:43:38,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:43:38,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:43:38,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:43:38,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:43:38,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:43:38,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:43:38,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:43:38,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:43:38,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:43:38,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:43:38,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:43:38,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:43:38,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:43:38,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:43:38,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:43:38,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:43:38,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:43:38,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:43:38,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:43:38,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:43:38,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:43:38,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:43:38,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:43:38,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:43:38,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:43:38,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:43:38,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:43:38,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:43:38,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:43:38,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:43:38,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:43:38,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:43:38,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:43:38,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:43:38,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:43:38,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:43:38,451 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:43:38,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:43:38,452 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:43:38,462 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:43:38,464 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:43:38,464 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:43:38,464 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:43:38,464 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:43:38,465 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:43:38,465 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:43:38,465 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:43:38,465 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:43:38,465 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:43:38,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:43:38,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:43:38,466 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:43:38,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:43:38,467 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:43:38,467 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:43:38,467 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:43:38,467 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:43:38,468 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:43:38,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:43:38,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:43:38,469 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:43:38,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:43:38,469 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:43:38,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:43:38,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:43:38,471 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:43:38,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:43:38,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:43:38,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:43:38,472 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:43:38,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:43:38,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:43:38,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:43:38,528 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:43:38,529 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:43:38,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-02-28 10:43:38,530 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-28 10:43:38,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:43:38,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:43:38,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:43:38,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:43:38,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:43:38,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,627 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:43:38,627 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:43:38,628 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:43:38,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:43:38,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:43:38,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:43:38,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:43:38,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... [2019-02-28 10:43:38,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:43:38,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:43:38,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:43:38,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:43:38,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:43:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:43:38,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:43:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-28 10:43:39,022 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:43:39,023 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-28 10:43:39,024 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:43:39 BoogieIcfgContainer [2019-02-28 10:43:39,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:43:39,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:43:39,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:43:39,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:43:39,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:43:38" (1/2) ... [2019-02-28 10:43:39,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d92cfd1 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:43:39, skipping insertion in model container [2019-02-28 10:43:39,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:43:39" (2/2) ... [2019-02-28 10:43:39,033 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-28 10:43:39,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:43:39,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:43:39,125 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:43:39,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:43:39,174 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:43:39,174 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:43:39,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:43:39,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:43:39,174 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:43:39,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:43:39,175 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:43:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-28 10:43:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:43:39,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:39,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:43:39,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-28 10:43:39,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:39,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:39,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:39,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:43:39,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:43:39,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:43:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:43:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:43:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:43:39,457 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-28 10:43:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:39,514 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-28 10:43:39,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:43:39,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:43:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:39,528 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:43:39,528 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:43:39,531 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-28 10:43:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:43:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-28 10:43:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:43:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-28 10:43:39,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-28 10:43:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:39,567 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-28 10:43:39,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:43:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 10:43:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:43:39,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:39,568 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-28 10:43:39,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:39,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-28 10:43:39,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:39,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:39,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:39,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:39,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:43:39,698 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-28 10:43:39,792 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:43:39,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:43:49,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:43:49,527 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:43:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:49,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:43:49,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:49,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:49,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:49,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:43:49,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:49,683 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:49,683 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:49,777 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:49,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:49,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:50,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:43:50,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:50,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:43:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:43:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:43:50,062 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-28 10:43:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:50,223 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-28 10:43:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:43:50,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-28 10:43:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:50,224 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:43:50,224 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:43:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-28 10:43:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:43:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-28 10:43:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:43:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-28 10:43:50,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-28 10:43:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:50,230 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-28 10:43:50,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:43:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-28 10:43:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:43:50,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:50,232 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-28 10:43:50,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-28 10:43:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:50,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:50,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:50,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:50,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:50,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:50,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:50,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:43:50,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:50,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:43:50,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:50,595 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:50,596 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:50,612 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:50,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:50,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:43:50,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:50,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:43:50,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:43:50,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:43:50,762 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-28 10:43:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:50,918 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-28 10:43:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:43:50,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-28 10:43:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:50,920 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:43:50,920 INFO L226 Difference]: Without dead ends: 18 [2019-02-28 10:43:50,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:43:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-28 10:43:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-28 10:43:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:43:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-28 10:43:50,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-28 10:43:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-28 10:43:50,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:43:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-28 10:43:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:43:50,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:50,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-28 10:43:50,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-28 10:43:50,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:50,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:51,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:51,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:51,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:51,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:51,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:51,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:51,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:51,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:51,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:51,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:43:51,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:51,097 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:51,097 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:51,112 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:51,112 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:43:51,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:51,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:43:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:43:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:43:51,291 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-28 10:43:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:51,719 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-28 10:43:51,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:43:51,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-28 10:43:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:51,720 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:43:51,720 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:43:51,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:43:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:43:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-28 10:43:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:43:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:43:51,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-28 10:43:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:51,725 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:43:51,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:43:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:43:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:43:51,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:51,726 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-28 10:43:51,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:51,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-28 10:43:51,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:51,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:51,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:51,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:51,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:51,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:51,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:51,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:51,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:51,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:51,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:51,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:51,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:51,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:43:51,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:51,889 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:51,889 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:51,895 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:51,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:52,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:52,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:52,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:43:52,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:52,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:43:52,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:43:52,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:43:52,491 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-28 10:43:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:52,567 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-28 10:43:52,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:43:52,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-28 10:43:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:52,571 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:43:52,571 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:43:52,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:43:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:43:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-28 10:43:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:43:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-28 10:43:52,576 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-28 10:43:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:52,577 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-28 10:43:52,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:43:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-28 10:43:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:43:52,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:52,578 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-28 10:43:52,578 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-28 10:43:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:52,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:52,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:52,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:52,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:52,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:52,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:52,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:52,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:52,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:52,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:43:52,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:52,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:43:52,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:52,783 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:52,784 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:52,797 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:52,797 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-28 10:43:53,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:53,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:43:53,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:43:53,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:43:53,167 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-28 10:43:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:53,232 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-28 10:43:53,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:43:53,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-28 10:43:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:53,234 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:43:53,234 INFO L226 Difference]: Without dead ends: 30 [2019-02-28 10:43:53,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 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-28 10:43:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-28 10:43:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-28 10:43:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:43:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-28 10:43:53,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-28 10:43:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:53,240 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-28 10:43:53,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:43:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-28 10:43:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:43:53,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:53,241 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-28 10:43:53,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-28 10:43:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:53,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:53,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:53,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:53,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:53,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:53,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:53,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:53,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:43:53,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:53,449 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:53,449 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,471 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,471 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:53,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-28 10:43:53,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:43:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:43:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:43:53,738 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-28 10:43:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:53,826 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:43:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:43:53,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-28 10:43:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:53,828 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:43:53,828 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:43:53,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:43:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:43:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-28 10:43:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:43:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-28 10:43:53,834 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-28 10:43:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:53,834 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-28 10:43:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:43:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-28 10:43:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:43:53,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:53,836 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-28 10:43:53,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-28 10:43:53,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:53,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:53,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:53,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:53,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:53,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:53,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:43:53,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:53,989 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:53,990 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:54,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:54,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:54,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-28 10:43:54,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:54,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:43:54,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:43:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:43:54,296 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-28 10:43:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:54,511 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-28 10:43:54,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:43:54,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-28 10:43:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:54,513 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:43:54,514 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:43:54,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 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-28 10:43:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:43:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-28 10:43:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:43:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-28 10:43:54,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-28 10:43:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:54,520 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-28 10:43:54,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:43:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-28 10:43:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:43:54,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:54,521 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-28 10:43:54,522 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-28 10:43:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:54,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:54,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:54,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:54,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:54,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:54,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:54,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:54,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:43:54,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:54,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:43:54,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:54,718 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:54,718 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:54,726 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:54,726 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:55,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:55,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-28 10:43:55,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:55,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:43:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:43:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:43:55,274 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-28 10:43:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:55,379 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-28 10:43:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:43:55,380 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-28 10:43:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:55,381 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:43:55,382 INFO L226 Difference]: Without dead ends: 42 [2019-02-28 10:43:55,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:43:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-28 10:43:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-28 10:43:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:43:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:43:55,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-28 10:43:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:55,392 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:43:55,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:43:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:43:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:43:55,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:55,394 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-28 10:43:55,395 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-28 10:43:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:55,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:55,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:55,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:55,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:55,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:55,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:55,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:55,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:55,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:55,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:55,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:43:55,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:55,653 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:55,654 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:55,662 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:55,662 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:55,917 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-28 10:43:56,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:56,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:43:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:43:56,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:43:56,320 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-28 10:43:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:56,412 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-28 10:43:56,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:43:56,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-28 10:43:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:56,414 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:43:56,414 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:43:56,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 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-28 10:43:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:43:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-28 10:43:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:43:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-28 10:43:56,420 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-28 10:43:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:56,421 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-28 10:43:56,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:43:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-28 10:43:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:43:56,422 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:56,422 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-28 10:43:56,422 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-28 10:43:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:56,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:56,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:57,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:57,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:57,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:57,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:57,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:57,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:57,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:57,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:43:57,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:57,352 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:57,353 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:57,363 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:57,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:57,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-28 10:43:57,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:57,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:43:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:43:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:43:57,717 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-28 10:43:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:57,832 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-28 10:43:57,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:43:57,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-28 10:43:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:57,834 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:43:57,834 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:43:57,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:43:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:43:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-28 10:43:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:43:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-28 10:43:57,844 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-28 10:43:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:57,845 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-28 10:43:57,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:43:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-28 10:43:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:43:57,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:57,846 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-28 10:43:57,846 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-28 10:43:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:57,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:57,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:58,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:58,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:58,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:58,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:58,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:58,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:58,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:58,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:58,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:43:58,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:58,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:43:58,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:58,115 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:58,116 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:58,124 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:58,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:58,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:58,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-28 10:43:58,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:58,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:43:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:43:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:43:58,634 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-28 10:43:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:58,751 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:43:58,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:43:58,752 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-28 10:43:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:58,753 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:43:58,753 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:43:58,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:43:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:43:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-28 10:43:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:43:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-28 10:43:58,761 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-28 10:43:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:58,761 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-28 10:43:58,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:43:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-28 10:43:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:43:58,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:58,762 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-28 10:43:58,763 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-28 10:43:58,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:59,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:59,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:59,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:59,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:59,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:59,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:59,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:59,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:59,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:59,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:59,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:43:59,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:59,255 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:59,256 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:59,266 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:59,266 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:59,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:59,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:59,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-28 10:43:59,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:59,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:43:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:43:59,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:43:59,778 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-28 10:43:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:59,870 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-28 10:43:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:43:59,870 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-28 10:43:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:59,871 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:43:59,871 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:43:59,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:43:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:43:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-28 10:43:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:43:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-28 10:43:59,878 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-28 10:43:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:59,879 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-28 10:43:59,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:43:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-28 10:43:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:43:59,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:59,880 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-28 10:43:59,880 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-28 10:43:59,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:59,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:59,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:00,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:00,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:00,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:00,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:00,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:44:00,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:00,247 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:00,247 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,255 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,256 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:00,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:01,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:01,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-28 10:44:01,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:01,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:44:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:44:01,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:44:01,537 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-28 10:44:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:01,819 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-28 10:44:01,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:44:01,819 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-28 10:44:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:01,820 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:44:01,821 INFO L226 Difference]: Without dead ends: 62 [2019-02-28 10:44:01,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:44:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-28 10:44:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-28 10:44:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:44:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:44:01,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-28 10:44:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:01,828 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:44:01,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:44:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:44:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:44:01,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:01,829 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-28 10:44:01,829 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-28 10:44:01,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:01,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:01,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:01,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:01,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:02,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:02,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:02,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:02,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:02,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:02,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:02,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:02,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:44:02,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:02,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:44:02,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:02,126 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:02,127 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:02,137 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:02,138 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-28 10:44:02,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:02,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:44:02,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:44:02,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:44:02,889 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-28 10:44:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:03,116 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-28 10:44:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:44:03,116 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-28 10:44:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:03,117 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:44:03,118 INFO L226 Difference]: Without dead ends: 66 [2019-02-28 10:44:03,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:44:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-28 10:44:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-28 10:44:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:44:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-28 10:44:03,127 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-28 10:44:03,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:03,128 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-28 10:44:03,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:44:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-28 10:44:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:44:03,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:03,129 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-28 10:44:03,130 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-28 10:44:03,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:03,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:03,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:03,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:03,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:03,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:03,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:03,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:03,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:03,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:03,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:03,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:03,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:03,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:03,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:44:03,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:03,527 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:03,527 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:03,539 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:03,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:03,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:04,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:04,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-28 10:44:04,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:04,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:44:04,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:44:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:44:04,193 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-28 10:44:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:04,324 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-28 10:44:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:44:04,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-28 10:44:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:04,326 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:44:04,326 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:44:04,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:44:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:44:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-28 10:44:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:44:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-28 10:44:04,334 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-28 10:44:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:04,334 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-28 10:44:04,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:44:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-28 10:44:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:44:04,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:04,336 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-28 10:44:04,336 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-28 10:44:04,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:04,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:04,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:04,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:04,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:04,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:04,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:04,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:04,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:04,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:04,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:44:04,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:04,717 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:04,717 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:04,726 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:04,727 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:06,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:06,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-28 10:44:06,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:06,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:44:06,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:44:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:44:06,834 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-28 10:44:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:06,939 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:44:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:44:06,941 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-28 10:44:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:06,942 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:44:06,942 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:44:06,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:44:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:44:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-28 10:44:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:44:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-28 10:44:06,949 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-28 10:44:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:06,950 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-28 10:44:06,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:44:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-28 10:44:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:44:06,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:06,951 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-28 10:44:06,952 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-28 10:44:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:06,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:07,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:07,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:07,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:07,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:07,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:07,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:07,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:44:07,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:07,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:44:07,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:07,316 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:07,317 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,365 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:07,622 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:08,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:08,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-28 10:44:08,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:08,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:44:08,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:44:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:44:08,404 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-28 10:44:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:08,512 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-28 10:44:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:44:08,513 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-28 10:44:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:08,514 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:44:08,514 INFO L226 Difference]: Without dead ends: 78 [2019-02-28 10:44:08,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:44:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-28 10:44:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-28 10:44:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:44:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-28 10:44:08,521 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-28 10:44:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:08,521 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-28 10:44:08,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:44:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-28 10:44:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:44:08,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:08,523 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-28 10:44:08,523 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-28 10:44:08,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:08,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:08,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:08,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:08,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:08,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:08,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:08,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:08,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:08,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:08,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:08,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:08,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:44:08,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:08,899 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:08,899 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:08,911 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:08,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:09,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:09,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:09,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-28 10:44:09,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:09,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:44:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:44:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:44:09,806 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-28 10:44:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:09,964 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-28 10:44:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:44:09,964 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-28 10:44:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:09,965 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:44:09,965 INFO L226 Difference]: Without dead ends: 82 [2019-02-28 10:44:09,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:44:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-28 10:44:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-28 10:44:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:44:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:44:09,971 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-28 10:44:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:09,971 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:44:09,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:44:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:44:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:44:09,972 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:09,972 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-28 10:44:09,972 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-28 10:44:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:09,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:09,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:10,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:10,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:10,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:10,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:10,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:10,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:10,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:10,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:44:10,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:10,919 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:10,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:10,927 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:10,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:11,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:12,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:12,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-28 10:44:12,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:12,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:44:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:44:12,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:44:12,087 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-28 10:44:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:12,222 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-28 10:44:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:44:12,223 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-28 10:44:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:12,224 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:44:12,224 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:44:12,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:44:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:44:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-28 10:44:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:44:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-28 10:44:12,229 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-28 10:44:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:12,230 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-28 10:44:12,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:44:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-28 10:44:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:44:12,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:12,231 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-28 10:44:12,231 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:12,232 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-28 10:44:12,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:12,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:12,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:12,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:13,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:13,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:13,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:13,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:13,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:13,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:13,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:13,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:13,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:44:13,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:13,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:44:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:13,169 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:13,170 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:13,179 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:13,179 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:13,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:14,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:14,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-28 10:44:14,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:14,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:44:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:44:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:44:14,220 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-28 10:44:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:14,385 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-28 10:44:14,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:44:14,385 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-28 10:44:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:14,387 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:44:14,387 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:44:14,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:44:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:44:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-28 10:44:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:44:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-28 10:44:14,393 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-28 10:44:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:14,393 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-28 10:44:14,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:44:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-28 10:44:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:44:14,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:14,394 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-28 10:44:14,395 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:14,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-28 10:44:14,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:14,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:14,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:14,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:14,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:14,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:14,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:14,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:14,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:14,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:14,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:14,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:14,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:14,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:14,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:14,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:44:14,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:14,841 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:14,842 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:14,882 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:14,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:15,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:16,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-28 10:44:16,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:16,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:44:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:44:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:44:16,316 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-28 10:44:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:16,507 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:44:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:44:16,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-28 10:44:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:16,511 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:44:16,511 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:44:16,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:44:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:44:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-28 10:44:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:44:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-28 10:44:16,515 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-28 10:44:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:16,515 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-28 10:44:16,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:44:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-28 10:44:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:44:16,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:16,516 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-28 10:44:16,516 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:16,517 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-28 10:44:16,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:16,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:16,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:17,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:17,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:17,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:17,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:17,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:17,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:17,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:17,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:17,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:44:17,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:17,099 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:17,099 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:17,113 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:17,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:17,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:18,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:18,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-28 10:44:18,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:18,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:44:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:44:18,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:44:18,272 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-28 10:44:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:18,421 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-28 10:44:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:44:18,421 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-28 10:44:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:18,422 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:44:18,423 INFO L226 Difference]: Without dead ends: 98 [2019-02-28 10:44:18,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:44:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-28 10:44:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-28 10:44:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:44:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-28 10:44:18,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-28 10:44:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:18,429 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-28 10:44:18,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:44:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-28 10:44:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:44:18,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:18,429 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-28 10:44:18,430 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-28 10:44:18,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:18,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:18,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:18,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:18,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:18,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:18,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:18,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:18,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:18,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:18,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:18,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:44:18,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:18,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:44:18,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:18,926 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:18,926 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:18,934 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:18,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:19,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:20,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:20,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-28 10:44:20,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:20,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:44:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:44:20,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:44:20,339 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-28 10:44:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:20,592 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-28 10:44:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:44:20,592 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-28 10:44:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:20,594 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:44:20,594 INFO L226 Difference]: Without dead ends: 102 [2019-02-28 10:44:20,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:44:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-28 10:44:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-28 10:44:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:44:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:44:20,599 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-28 10:44:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:20,600 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:44:20,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:44:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:44:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:44:20,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:20,601 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-28 10:44:20,601 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-28 10:44:20,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:20,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:20,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:20,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:21,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:21,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:21,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:21,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:21,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:21,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:21,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:21,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:21,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:21,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:44:21,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:21,229 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:21,229 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:21,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:21,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:21,948 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:23,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:23,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-28 10:44:23,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:23,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:44:23,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:44:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:44:23,024 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-28 10:44:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:23,215 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-28 10:44:23,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:44:23,215 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-28 10:44:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:23,216 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:44:23,216 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:44:23,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:44:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:44:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-28 10:44:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:44:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-28 10:44:23,222 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-28 10:44:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:23,223 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-28 10:44:23,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:44:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-28 10:44:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:44:23,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:23,224 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-28 10:44:23,224 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:23,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-28 10:44:23,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:23,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:23,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:23,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:23,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:23,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:23,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:23,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:23,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:23,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:23,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:23,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:23,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:44:23,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:23,771 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:23,771 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:23,779 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:23,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:24,239 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:25,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:25,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-28 10:44:25,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:25,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:44:25,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:44:25,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:44:25,176 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-28 10:44:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:25,338 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-28 10:44:25,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:44:25,339 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-28 10:44:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:25,340 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:44:25,340 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:44:25,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:44:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:44:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-28 10:44:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:44:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-28 10:44:25,346 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-28 10:44:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:25,346 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-28 10:44:25,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:44:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-28 10:44:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:44:25,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:25,347 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-28 10:44:25,347 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-28 10:44:25,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:25,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:25,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:25,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:25,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:25,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:25,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:25,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:25,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:25,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:25,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:25,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:44:25,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:25,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:44:26,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:26,020 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:26,021 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:26,028 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:26,028 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:26,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:27,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:27,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-28 10:44:27,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:27,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:44:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:44:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:44:27,833 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-28 10:44:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:28,019 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:44:28,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:44:28,019 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-28 10:44:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:28,020 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:44:28,020 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:44:28,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:44:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:44:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-28 10:44:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:44:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-28 10:44:28,026 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-28 10:44:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:28,027 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-28 10:44:28,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:44:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-28 10:44:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:44:28,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:28,028 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-28 10:44:28,028 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-28 10:44:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:28,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:28,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:28,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:28,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:28,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:28,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:28,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:28,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:28,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:28,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:28,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:44:28,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:28,737 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:28,738 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:28,761 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:28,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:29,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:30,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-28 10:44:30,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:44:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:44:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:44:30,495 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-28 10:44:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:30,691 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-28 10:44:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:44:30,691 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-28 10:44:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:30,692 INFO L225 Difference]: With dead ends: 119 [2019-02-28 10:44:30,693 INFO L226 Difference]: Without dead ends: 118 [2019-02-28 10:44:30,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:44:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-28 10:44:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-28 10:44:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-28 10:44:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-28 10:44:30,697 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-28 10:44:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:30,697 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-28 10:44:30,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:44:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-28 10:44:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-28 10:44:30,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:30,698 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-28 10:44:30,698 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-28 10:44:30,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:30,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:30,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:31,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:31,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:31,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:31,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:31,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:31,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:31,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:31,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:44:31,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:31,447 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:31,449 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:31,487 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:31,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:32,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:33,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:33,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-28 10:44:33,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:33,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:44:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:44:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:44:33,576 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-28 10:44:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:33,786 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-28 10:44:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:44:33,787 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-28 10:44:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:33,788 INFO L225 Difference]: With dead ends: 123 [2019-02-28 10:44:33,788 INFO L226 Difference]: Without dead ends: 122 [2019-02-28 10:44:33,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:44:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-28 10:44:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-28 10:44:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:44:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-28 10:44:33,794 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-28 10:44:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:33,794 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-28 10:44:33,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:44:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-28 10:44:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-28 10:44:33,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:33,795 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-28 10:44:33,796 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-28 10:44:33,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:33,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:34,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:34,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:34,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:34,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:34,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:34,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:34,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:34,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:44:34,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:34,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:44:34,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:34,499 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:34,499 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:34,508 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:34,508 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:35,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:36,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:36,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-28 10:44:36,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:36,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:44:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:44:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:44:36,455 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-28 10:44:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:36,645 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-28 10:44:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:44:36,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-28 10:44:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:36,647 INFO L225 Difference]: With dead ends: 127 [2019-02-28 10:44:36,647 INFO L226 Difference]: Without dead ends: 126 [2019-02-28 10:44:36,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:44:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-28 10:44:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-28 10:44:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-28 10:44:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-28 10:44:36,653 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-28 10:44:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-28 10:44:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:44:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-28 10:44:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-28 10:44:36,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:36,654 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-28 10:44:36,654 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-28 10:44:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:37,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:37,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:37,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:37,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:37,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:37,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:37,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:37,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:37,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:37,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:44:37,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:37,649 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:37,650 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:37,658 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:37,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:38,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:39,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:39,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-28 10:44:39,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:39,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:44:39,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:44:39,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:44:39,566 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-28 10:44:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:39,801 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-28 10:44:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:44:39,801 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-28 10:44:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:39,803 INFO L225 Difference]: With dead ends: 131 [2019-02-28 10:44:39,803 INFO L226 Difference]: Without dead ends: 130 [2019-02-28 10:44:39,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:44:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-28 10:44:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-28 10:44:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-28 10:44:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-28 10:44:39,808 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-28 10:44:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:39,809 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-28 10:44:39,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:44:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-28 10:44:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-28 10:44:39,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:39,810 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-28 10:44:39,810 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-28 10:44:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:39,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:39,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:39,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:40,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:40,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:40,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:40,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:40,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:40,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:40,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:40,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:44:40,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:40,473 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:40,473 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:40,484 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:40,484 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:41,254 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:42,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:42,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-28 10:44:42,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:42,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:44:42,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:44:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:44:42,832 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-28 10:44:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:43,050 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-28 10:44:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:44:43,050 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-28 10:44:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:43,052 INFO L225 Difference]: With dead ends: 135 [2019-02-28 10:44:43,052 INFO L226 Difference]: Without dead ends: 134 [2019-02-28 10:44:43,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:44:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-28 10:44:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-28 10:44:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:44:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-28 10:44:43,058 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-28 10:44:43,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:43,058 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-28 10:44:43,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:44:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-28 10:44:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-28 10:44:43,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:43,060 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-28 10:44:43,060 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-28 10:44:43,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:43,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:43,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:43,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:44,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:44,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:44,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:44,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:44,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:44,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:44,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:44,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:44,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:44:44,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:44,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:44:44,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:44,884 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:44,884 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:44,894 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:44,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:45,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:47,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:47,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-28 10:44:47,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:47,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:44:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:44:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:44:47,650 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-28 10:44:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:47,908 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-28 10:44:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:44:47,908 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-28 10:44:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:47,910 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:44:47,910 INFO L226 Difference]: Without dead ends: 138 [2019-02-28 10:44:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:44:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-28 10:44:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-28 10:44:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:44:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-28 10:44:47,916 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-28 10:44:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:47,917 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-28 10:44:47,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:44:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-28 10:44:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-28 10:44:47,917 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:47,918 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-28 10:44:47,918 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-28 10:44:47,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:47,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:47,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:48,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:48,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:48,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:48,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:48,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:48,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:48,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:48,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:48,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:48,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:44:48,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:48,725 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:48,726 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:48,825 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:48,826 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:50,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:52,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-28 10:44:52,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:52,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:44:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:44:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:44:52,587 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-28 10:44:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:52,948 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-28 10:44:52,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:44:52,948 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-28 10:44:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:52,950 INFO L225 Difference]: With dead ends: 143 [2019-02-28 10:44:52,950 INFO L226 Difference]: Without dead ends: 142 [2019-02-28 10:44:52,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:44:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-28 10:44:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-28 10:44:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:44:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-28 10:44:52,956 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-28 10:44:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:52,956 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-28 10:44:52,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:44:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-28 10:44:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-28 10:44:52,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:52,957 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-28 10:44:52,957 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-28 10:44:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:52,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:52,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:52,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:53,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:53,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:53,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:53,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:53,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:53,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:53,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:53,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:53,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-28 10:44:53,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:53,779 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:53,779 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:53,790 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:53,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:54,713 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:56,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-28 10:44:56,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:56,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:44:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:44:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:44:56,294 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-28 10:44:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:56,737 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-28 10:44:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:44:56,737 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-28 10:44:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:56,739 INFO L225 Difference]: With dead ends: 147 [2019-02-28 10:44:56,739 INFO L226 Difference]: Without dead ends: 146 [2019-02-28 10:44:56,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:44:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-28 10:44:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-28 10:44:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-28 10:44:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-28 10:44:56,746 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-28 10:44:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:56,746 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-28 10:44:56,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:44:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-28 10:44:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-28 10:44:56,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:56,748 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-28 10:44:56,748 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-28 10:44:56,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:56,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:59,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:59,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:59,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:59,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:59,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:59,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:59,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:59,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:44:59,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:59,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:44:59,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:59,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:59,502 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:59,512 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:59,512 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:00,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:02,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:02,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-28 10:45:02,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:02,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:45:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:45:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:45:02,113 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-28 10:45:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:02,561 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-28 10:45:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:45:02,562 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-28 10:45:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:02,564 INFO L225 Difference]: With dead ends: 151 [2019-02-28 10:45:02,564 INFO L226 Difference]: Without dead ends: 150 [2019-02-28 10:45:02,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:45:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-28 10:45:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-28 10:45:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:45:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-28 10:45:02,570 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-28 10:45:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:02,570 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-28 10:45:02,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:45:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-28 10:45:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-28 10:45:02,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:02,572 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-28 10:45:02,572 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-28 10:45:02,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:02,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:02,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:03,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:03,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:03,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:03,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:03,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:03,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:03,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:03,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:03,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:03,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:45:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:03,520 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:03,521 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:03,530 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:03,530 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:04,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:06,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:06,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-28 10:45:06,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:06,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:45:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:45:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:45:06,390 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-28 10:45:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:06,716 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-28 10:45:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:45:06,716 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-28 10:45:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:06,718 INFO L225 Difference]: With dead ends: 155 [2019-02-28 10:45:06,718 INFO L226 Difference]: Without dead ends: 154 [2019-02-28 10:45:06,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:45:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-28 10:45:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-28 10:45:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-28 10:45:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-28 10:45:06,725 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-28 10:45:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:06,726 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-28 10:45:06,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:45:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-28 10:45:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-28 10:45:06,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:06,727 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-28 10:45:06,727 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-28 10:45:06,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:06,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:06,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:06,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:07,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:07,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:07,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:07,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:07,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:07,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:07,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:07,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-28 10:45:07,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:07,693 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:07,694 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:07,807 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:07,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:09,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:10,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:10,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-28 10:45:10,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:10,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:45:10,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:45:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:45:10,870 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-28 10:45:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:11,125 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-28 10:45:11,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:45:11,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-28 10:45:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:11,127 INFO L225 Difference]: With dead ends: 159 [2019-02-28 10:45:11,127 INFO L226 Difference]: Without dead ends: 158 [2019-02-28 10:45:11,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:45:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-28 10:45:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-28 10:45:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:45:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-28 10:45:11,134 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-28 10:45:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:11,134 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-28 10:45:11,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:45:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-28 10:45:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:45:11,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:11,136 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-28 10:45:11,136 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-28 10:45:11,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:11,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:12,430 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-28 10:45:12,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:12,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:12,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:12,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:12,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:12,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:12,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:12,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:12,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:45:12,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:12,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-28 10:45:12,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:12,583 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:12,583 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:12,592 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:12,592 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:13,873 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-28 10:45:13,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:15,744 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-28 10:45:15,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:15,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-28 10:45:15,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:15,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:45:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:45:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:45:15,766 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-28 10:45:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:16,056 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-28 10:45:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:45:16,057 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-28 10:45:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:16,058 INFO L225 Difference]: With dead ends: 163 [2019-02-28 10:45:16,058 INFO L226 Difference]: Without dead ends: 162 [2019-02-28 10:45:16,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 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-28 10:45:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-28 10:45:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-28 10:45:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:45:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-28 10:45:16,065 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-28 10:45:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-28 10:45:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:45:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-28 10:45:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:45:16,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:16,066 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-28 10:45:16,067 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-28 10:45:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:16,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:16,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:17,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:17,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:17,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:17,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:17,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:17,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:17,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:17,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:17,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:17,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:45:17,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:17,397 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:17,398 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:17,412 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:17,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:18,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:21,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:21,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-28 10:45:21,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:21,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:45:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:45:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:45:21,204 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-28 10:45:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:21,661 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-28 10:45:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:45:21,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-28 10:45:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:21,663 INFO L225 Difference]: With dead ends: 167 [2019-02-28 10:45:21,663 INFO L226 Difference]: Without dead ends: 166 [2019-02-28 10:45:21,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:45:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-28 10:45:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-28 10:45:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-28 10:45:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-28 10:45:21,670 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-28 10:45:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:21,670 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-28 10:45:21,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:45:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-28 10:45:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-28 10:45:21,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:21,672 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-28 10:45:21,672 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-28 10:45:21,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:21,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:21,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:22,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:22,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:22,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:22,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:22,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:22,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:22,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:22,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:22,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-28 10:45:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:22,733 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:22,733 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:22,786 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:22,787 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:24,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:26,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:26,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-28 10:45:26,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:26,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:45:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:45:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:45:26,254 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-28 10:45:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:26,536 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-28 10:45:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:45:26,536 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-28 10:45:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:26,538 INFO L225 Difference]: With dead ends: 171 [2019-02-28 10:45:26,538 INFO L226 Difference]: Without dead ends: 170 [2019-02-28 10:45:26,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:45:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-28 10:45:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-28 10:45:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-28 10:45:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-28 10:45:26,544 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-28 10:45:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:26,545 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-28 10:45:26,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:45:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-28 10:45:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-28 10:45:26,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:26,546 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-28 10:45:26,546 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-28 10:45:26,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:26,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:27,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:27,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:27,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:27,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:27,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:27,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:27,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:27,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:27,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:45:27,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:27,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:45:27,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:27,679 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:27,680 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:27,780 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:27,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:29,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-28 10:45:31,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:31,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:45:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:45:31,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:45:31,387 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-28 10:45:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:31,670 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-28 10:45:31,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:45:31,671 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-28 10:45:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:31,672 INFO L225 Difference]: With dead ends: 175 [2019-02-28 10:45:31,672 INFO L226 Difference]: Without dead ends: 174 [2019-02-28 10:45:31,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 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-28 10:45:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-28 10:45:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-28 10:45:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-28 10:45:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-28 10:45:31,678 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-28 10:45:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:31,679 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-28 10:45:31,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:45:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-28 10:45:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-28 10:45:31,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:31,680 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-28 10:45:31,680 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-28 10:45:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:31,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:32,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:32,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:32,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:32,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:32,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:32,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:32,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:32,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:32,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:32,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-28 10:45:32,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:32,822 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:32,823 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:32,833 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:32,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:34,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:36,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:36,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-28 10:45:36,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:36,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:45:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:45:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:45:36,561 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-28 10:45:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:37,147 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-28 10:45:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:45:37,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-28 10:45:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:37,148 INFO L225 Difference]: With dead ends: 179 [2019-02-28 10:45:37,148 INFO L226 Difference]: Without dead ends: 178 [2019-02-28 10:45:37,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:45:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-28 10:45:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-28 10:45:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-28 10:45:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-28 10:45:37,155 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-28 10:45:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:37,155 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-28 10:45:37,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:45:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-28 10:45:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-28 10:45:37,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:37,157 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-28 10:45:37,157 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-28 10:45:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:37,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:37,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:38,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:38,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:38,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:38,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:38,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:38,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:38,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:38,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:38,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-28 10:45:38,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:38,521 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:38,521 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:38,538 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:38,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:39,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:42,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:42,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-28 10:45:42,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:45:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:45:42,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:45:42,359 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-28 10:45:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:42,656 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-28 10:45:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:45:42,657 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-28 10:45:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:42,658 INFO L225 Difference]: With dead ends: 183 [2019-02-28 10:45:42,658 INFO L226 Difference]: Without dead ends: 182 [2019-02-28 10:45:42,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:45:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-28 10:45:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-28 10:45:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-28 10:45:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-28 10:45:42,663 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-28 10:45:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:42,664 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-28 10:45:42,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:45:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-28 10:45:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-28 10:45:42,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:42,665 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-28 10:45:42,665 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-28 10:45:42,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:42,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:42,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:42,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:42,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:44,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:44,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:44,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:44,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:44,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:44,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:44,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:45:44,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-28 10:45:44,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:44,214 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:44,215 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:44,222 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:44,222 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:45,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:48,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:48,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-28 10:45:48,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:48,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:45:48,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:45:48,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-28 10:45:48,104 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-28 10:45:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:48,461 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-28 10:45:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:45:48,462 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-28 10:45:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:48,463 INFO L225 Difference]: With dead ends: 187 [2019-02-28 10:45:48,464 INFO L226 Difference]: Without dead ends: 186 [2019-02-28 10:45:48,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 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-28 10:45:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-28 10:45:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-28 10:45:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-28 10:45:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-28 10:45:48,471 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-28 10:45:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:48,471 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-28 10:45:48,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:45:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-28 10:45:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-28 10:45:48,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:48,472 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-28 10:45:48,472 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-28 10:45:48,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:48,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:48,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:48,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:48,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:49,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:49,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:49,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:49,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:49,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:49,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:49,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:49,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:49,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:49,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-28 10:45:49,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:49,848 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:49,848 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:49,858 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:49,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:51,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:54,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:54,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-28 10:45:54,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:54,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:45:54,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:45:54,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:45:54,159 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-28 10:45:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:54,501 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-28 10:45:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:45:54,502 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-28 10:45:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:54,503 INFO L225 Difference]: With dead ends: 191 [2019-02-28 10:45:54,503 INFO L226 Difference]: Without dead ends: 190 [2019-02-28 10:45:54,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:45:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-28 10:45:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-28 10:45:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-28 10:45:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-28 10:45:54,508 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-28 10:45:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:54,509 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-28 10:45:54,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:45:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-28 10:45:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-28 10:45:54,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:54,510 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-28 10:45:54,510 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-28 10:45:54,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:54,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:54,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:56,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:56,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:56,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:56,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:56,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:56,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:56,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:56,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 148 conjunts are in the unsatisfiable core [2019-02-28 10:45:56,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:56,512 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:56,513 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:56,553 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:56,554 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:58,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:02,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:02,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-28 10:46:02,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:02,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:46:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:46:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-28 10:46:02,184 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-28 10:46:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:02,561 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-28 10:46:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:46:02,562 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-28 10:46:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:02,563 INFO L225 Difference]: With dead ends: 195 [2019-02-28 10:46:02,564 INFO L226 Difference]: Without dead ends: 194 [2019-02-28 10:46:02,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-28 10:46:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-28 10:46:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-28 10:46:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-28 10:46:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-28 10:46:02,572 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-28 10:46:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:02,573 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-28 10:46:02,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:46:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-28 10:46:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-28 10:46:02,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:02,574 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-28 10:46:02,574 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-28 10:46:02,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:02,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:02,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:02,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:02,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:05,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:05,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:05,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:05,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:05,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:05,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:05,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:05,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:05,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:46:05,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:05,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-28 10:46:05,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:05,300 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:05,301 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:05,349 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:05,349 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:06,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:09,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:09,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-28 10:46:09,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:09,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:46:09,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:46:09,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:46:09,926 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-28 10:46:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:10,355 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-28 10:46:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:46:10,356 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-28 10:46:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:10,357 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:46:10,357 INFO L226 Difference]: Without dead ends: 198 [2019-02-28 10:46:10,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:46:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-28 10:46:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-28 10:46:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-28 10:46:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-28 10:46:10,363 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-28 10:46:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:10,363 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-28 10:46:10,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:46:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-28 10:46:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-28 10:46:10,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:10,365 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-28 10:46:10,365 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-28 10:46:10,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:10,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:10,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:11,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:11,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:11,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:11,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:11,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:11,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:11,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:11,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:11,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:11,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:11,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:46:11,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:11,799 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:11,799 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:11,810 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:11,810 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:13,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:16,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:16,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-28 10:46:16,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:16,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:46:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:46:16,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:46:16,935 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-28 10:46:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:17,312 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-28 10:46:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:46:17,313 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-28 10:46:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:17,314 INFO L225 Difference]: With dead ends: 203 [2019-02-28 10:46:17,314 INFO L226 Difference]: Without dead ends: 202 [2019-02-28 10:46:17,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:46:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-28 10:46:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-28 10:46:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-28 10:46:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-28 10:46:17,321 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-28 10:46:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:17,321 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-28 10:46:17,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:46:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-28 10:46:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-28 10:46:17,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:17,322 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-28 10:46:17,323 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-28 10:46:17,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:17,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:17,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:18,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:18,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:18,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:18,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:18,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:18,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:18,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:18,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:18,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 157 conjunts are in the unsatisfiable core [2019-02-28 10:46:18,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:18,692 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:18,692 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:18,703 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:18,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:20,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:23,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-28 10:46:23,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:23,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:46:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:46:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:46:23,674 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-28 10:46:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:24,002 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-28 10:46:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:46:24,003 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-28 10:46:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:24,004 INFO L225 Difference]: With dead ends: 207 [2019-02-28 10:46:24,005 INFO L226 Difference]: Without dead ends: 206 [2019-02-28 10:46:24,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 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-28 10:46:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-28 10:46:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-28 10:46:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-28 10:46:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-28 10:46:24,011 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-28 10:46:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:24,012 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-28 10:46:24,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:46:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-28 10:46:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-28 10:46:24,013 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:24,013 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-28 10:46:24,013 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-28 10:46:24,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:25,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:25,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:25,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:25,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:25,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:25,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:25,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:25,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:25,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:46:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:25,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-28 10:46:25,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:25,951 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:25,951 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:25,959 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:25,960 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:27,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:30,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-28 10:46:30,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:30,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:46:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:46:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-28 10:46:30,944 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-28 10:46:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:31,348 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-28 10:46:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:46:31,349 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-28 10:46:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:31,350 INFO L225 Difference]: With dead ends: 211 [2019-02-28 10:46:31,350 INFO L226 Difference]: Without dead ends: 210 [2019-02-28 10:46:31,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-28 10:46:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-28 10:46:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-28 10:46:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-28 10:46:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-28 10:46:31,357 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-28 10:46:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:31,358 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-28 10:46:31,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:46:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-28 10:46:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-28 10:46:31,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:31,359 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-28 10:46:31,359 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-28 10:46:31,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:31,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:31,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:31,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:31,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:33,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:33,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:33,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:33,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:33,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:33,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:33,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:33,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:33,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:33,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:33,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-28 10:46:33,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:33,435 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:33,436 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:33,531 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:33,532 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:35,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:38,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:38,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-28 10:46:38,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:38,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:46:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:46:38,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:46:38,906 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-28 10:46:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:39,345 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-28 10:46:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:46:39,345 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-28 10:46:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:39,348 INFO L225 Difference]: With dead ends: 215 [2019-02-28 10:46:39,348 INFO L226 Difference]: Without dead ends: 214 [2019-02-28 10:46:39,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:46:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-28 10:46:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-28 10:46:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:46:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-28 10:46:39,355 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-28 10:46:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:39,355 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-28 10:46:39,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:46:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-28 10:46:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-28 10:46:39,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:39,356 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-28 10:46:39,357 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-28 10:46:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:39,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:39,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:41,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:41,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:41,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:41,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:41,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:41,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:41,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-28 10:46:41,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:41,155 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:41,156 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:41,184 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:41,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:42,904 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:46,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:46,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-28 10:46:46,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:46,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:46:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:46:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:46:46,555 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-28 10:46:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:46,927 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-28 10:46:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:46:46,927 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-28 10:46:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:46,929 INFO L225 Difference]: With dead ends: 219 [2019-02-28 10:46:46,929 INFO L226 Difference]: Without dead ends: 218 [2019-02-28 10:46:46,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:46:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-28 10:46:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-28 10:46:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-28 10:46:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-28 10:46:46,935 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-28 10:46:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:46,936 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-28 10:46:46,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:46:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-28 10:46:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-28 10:46:46,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:46,937 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-28 10:46:46,937 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-28 10:46:46,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:46,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:46,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:48,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:48,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:48,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:48,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:48,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:48,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:48,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:46:48,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-28 10:46:48,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:48,666 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:48,667 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:48,676 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:48,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:50,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:54,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:54,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-28 10:46:54,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:54,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:46:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:46:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:46:54,019 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-28 10:46:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:54,405 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-28 10:46:54,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:46:54,406 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-28 10:46:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:54,407 INFO L225 Difference]: With dead ends: 223 [2019-02-28 10:46:54,407 INFO L226 Difference]: Without dead ends: 222 [2019-02-28 10:46:54,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:46:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-28 10:46:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-28 10:46:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-28 10:46:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-28 10:46:54,412 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-28 10:46:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:54,412 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-28 10:46:54,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:46:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-28 10:46:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-28 10:46:54,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:54,413 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-28 10:46:54,414 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-28 10:46:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:54,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:54,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:54,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:56,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:56,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:56,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:56,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:56,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:56,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:56,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:56,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:56,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:56,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-28 10:46:56,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:56,228 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:56,228 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:56,238 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:56,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:58,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:01,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:01,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-28 10:47:01,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:01,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:47:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:47:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:47:01,855 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-28 10:47:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:02,322 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-28 10:47:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:47:02,323 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-28 10:47:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:02,325 INFO L225 Difference]: With dead ends: 227 [2019-02-28 10:47:02,325 INFO L226 Difference]: Without dead ends: 226 [2019-02-28 10:47:02,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:47:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-28 10:47:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-28 10:47:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-28 10:47:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-28 10:47:02,332 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-28 10:47:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:02,332 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-28 10:47:02,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:47:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-28 10:47:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-28 10:47:02,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:02,334 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-28 10:47:02,334 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-28 10:47:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:02,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:02,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:03,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:03,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:03,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:03,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:03,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:03,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:03,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:03,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 175 conjunts are in the unsatisfiable core [2019-02-28 10:47:03,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:03,995 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:03,995 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:04,008 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:04,009 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:06,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:09,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-28 10:47:09,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:09,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-28 10:47:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-28 10:47:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:47:09,574 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-28 10:47:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:10,052 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-28 10:47:10,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:47:10,052 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-28 10:47:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:10,054 INFO L225 Difference]: With dead ends: 231 [2019-02-28 10:47:10,055 INFO L226 Difference]: Without dead ends: 230 [2019-02-28 10:47:10,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:47:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-28 10:47:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-28 10:47:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-28 10:47:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-28 10:47:10,062 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-28 10:47:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:10,063 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-28 10:47:10,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-28 10:47:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-28 10:47:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-28 10:47:10,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:10,064 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-28 10:47:10,064 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-28 10:47:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:10,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:12,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:12,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:12,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:12,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:12,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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:12,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:12,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:12,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:47:12,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:12,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:47:12,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:12,289 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:12,289 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:12,301 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:12,301 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:14,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:18,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:18,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-28 10:47:18,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:18,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-28 10:47:18,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-28 10:47:18,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-28 10:47:18,020 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-28 10:47:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:18,540 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-28 10:47:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:47:18,541 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-28 10:47:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:18,542 INFO L225 Difference]: With dead ends: 235 [2019-02-28 10:47:18,542 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 10:47:18,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-28 10:47:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 10:47:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-28 10:47:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-28 10:47:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-28 10:47:18,550 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-28 10:47:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:18,550 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-28 10:47:18,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-28 10:47:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-28 10:47:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-28 10:47:18,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:18,551 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-28 10:47:18,552 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-28 10:47:18,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:18,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:18,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:20,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:20,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:20,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:20,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:20,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:20,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:20,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:20,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:20,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:20,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:20,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-28 10:47:20,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:20,499 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:20,499 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:20,508 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:20,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:22,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:26,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-28 10:47:26,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:26,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:47:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:47:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:47:26,766 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-28 10:47:27,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:27,283 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-28 10:47:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:47:27,284 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-28 10:47:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:27,285 INFO L225 Difference]: With dead ends: 239 [2019-02-28 10:47:27,285 INFO L226 Difference]: Without dead ends: 238 [2019-02-28 10:47:27,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:47:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-28 10:47:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-28 10:47:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-28 10:47:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-28 10:47:27,292 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-28 10:47:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:27,293 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-28 10:47:27,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:47:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-28 10:47:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-28 10:47:27,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:27,294 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-28 10:47:27,295 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:27,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:27,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-28 10:47:27,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:27,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:27,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:29,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:29,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:29,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:29,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:29,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:29,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:29,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:29,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 184 conjunts are in the unsatisfiable core [2019-02-28 10:47:29,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:29,195 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:29,195 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:29,206 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:29,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:31,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:35,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:35,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-28 10:47:35,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:35,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-28 10:47:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-28 10:47:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:47:35,198 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-28 10:47:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:35,703 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-28 10:47:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:47:35,703 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-28 10:47:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:35,704 INFO L225 Difference]: With dead ends: 243 [2019-02-28 10:47:35,705 INFO L226 Difference]: Without dead ends: 242 [2019-02-28 10:47:35,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:47:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-28 10:47:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-28 10:47:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-28 10:47:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-28 10:47:35,710 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-28 10:47:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:35,710 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-28 10:47:35,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-28 10:47:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-28 10:47:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-28 10:47:35,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:35,712 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-28 10:47:35,712 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-28 10:47:35,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:35,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:35,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:35,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:38,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:38,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:38,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:38,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:38,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:38,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:38,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:38,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:38,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:47:38,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:38,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-28 10:47:38,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:38,390 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:38,390 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,397 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:38,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:40,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:44,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:44,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-28 10:47:44,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:44,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-28 10:47:44,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-28 10:47:44,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:47:44,637 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-28 10:47:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:45,347 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-28 10:47:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:47:45,348 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-28 10:47:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:45,350 INFO L225 Difference]: With dead ends: 247 [2019-02-28 10:47:45,350 INFO L226 Difference]: Without dead ends: 246 [2019-02-28 10:47:45,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:47:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-28 10:47:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-28 10:47:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-28 10:47:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-28 10:47:45,357 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-28 10:47:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:45,358 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-28 10:47:45,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-28 10:47:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-28 10:47:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-28 10:47:45,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:45,359 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-28 10:47:45,359 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-28 10:47:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:45,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:45,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:45,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:47,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:47,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:47,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:47,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:47,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:47,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:47,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:47,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:47,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:47,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:47:47,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:47,671 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:47,672 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:47,689 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:47,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:49,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-28 10:47:53,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:53,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:47:53,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:47:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:47:53,817 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-28 10:47:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:54,346 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-28 10:47:54,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:47:54,347 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-28 10:47:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:54,348 INFO L225 Difference]: With dead ends: 251 [2019-02-28 10:47:54,348 INFO L226 Difference]: Without dead ends: 250 [2019-02-28 10:47:54,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:47:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-28 10:47:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-28 10:47:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-28 10:47:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-28 10:47:54,356 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-28 10:47:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:54,356 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-28 10:47:54,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:47:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-28 10:47:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-28 10:47:54,358 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:54,358 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-28 10:47:54,358 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-28 10:47:54,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:54,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:56,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:56,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:56,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:56,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:56,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:56,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:56,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:56,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 193 conjunts are in the unsatisfiable core [2019-02-28 10:47:56,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:56,404 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:56,404 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:56,415 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:56,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:58,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:02,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-28 10:48:02,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:02,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-28 10:48:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-28 10:48:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:48:02,988 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-28 10:48:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:03,475 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-28 10:48:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:48:03,475 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-28 10:48:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:03,476 INFO L225 Difference]: With dead ends: 255 [2019-02-28 10:48:03,477 INFO L226 Difference]: Without dead ends: 254 [2019-02-28 10:48:03,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:48:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-28 10:48:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-28 10:48:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-28 10:48:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-28 10:48:03,482 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-28 10:48:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:03,483 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-28 10:48:03,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-28 10:48:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-28 10:48:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-28 10:48:03,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:03,484 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-28 10:48:03,484 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-28 10:48:03,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:03,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:03,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:05,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:05,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:05,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:05,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:05,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:05,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:05,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:48:05,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:05,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-28 10:48:05,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:05,774 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:05,774 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:05,782 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:05,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:08,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:12,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-28 10:48:12,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:12,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-28 10:48:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-28 10:48:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:48:12,068 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-28 10:48:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:12,608 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-28 10:48:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:48:12,609 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-28 10:48:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:12,610 INFO L225 Difference]: With dead ends: 259 [2019-02-28 10:48:12,610 INFO L226 Difference]: Without dead ends: 258 [2019-02-28 10:48:12,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:48:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-28 10:48:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-28 10:48:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-28 10:48:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-28 10:48:12,615 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-28 10:48:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-28 10:48:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-28 10:48:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-28 10:48:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-28 10:48:12,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:12,617 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-28 10:48:12,617 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-28 10:48:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:12,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:12,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:14,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:14,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:14,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:14,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:14,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:14,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:14,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:14,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:14,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:14,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:14,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-28 10:48:14,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:14,778 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:14,778 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:14,789 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:14,790 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:17,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:21,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:21,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-28 10:48:21,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:21,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:48:21,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:48:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:48:21,255 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-28 10:48:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:21,788 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-28 10:48:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:48:21,788 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-28 10:48:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:21,790 INFO L225 Difference]: With dead ends: 263 [2019-02-28 10:48:21,790 INFO L226 Difference]: Without dead ends: 262 [2019-02-28 10:48:21,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:48:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-28 10:48:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-28 10:48:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-28 10:48:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-28 10:48:21,797 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-28 10:48:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-28 10:48:21,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:48:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-28 10:48:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-28 10:48:21,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:21,799 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-28 10:48:21,799 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-28 10:48:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:21,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:21,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:24,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:24,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:24,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:24,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:24,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:24,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:24,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:24,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:24,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-28 10:48:24,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:24,376 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:24,376 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:24,386 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:24,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:26,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-28 10:48:30,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:30,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-28 10:48:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-28 10:48:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-28 10:48:30,979 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-28 10:48:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:31,531 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-28 10:48:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:48:31,531 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-28 10:48:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:31,533 INFO L225 Difference]: With dead ends: 267 [2019-02-28 10:48:31,533 INFO L226 Difference]: Without dead ends: 266 [2019-02-28 10:48:31,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-28 10:48:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-28 10:48:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-28 10:48:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-28 10:48:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-28 10:48:31,540 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-28 10:48:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:31,540 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-28 10:48:31,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-28 10:48:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-28 10:48:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-28 10:48:31,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:31,542 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-28 10:48:31,542 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-28 10:48:31,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:31,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:31,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:33,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:33,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:33,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:33,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:33,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:34,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:48:34,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:34,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-28 10:48:34,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:34,281 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:34,282 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:34,292 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:34,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:36,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:41,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:41,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-28 10:48:41,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:41,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-28 10:48:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-28 10:48:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:48:41,055 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-28 10:48:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:41,684 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-28 10:48:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:48:41,684 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-28 10:48:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:41,686 INFO L225 Difference]: With dead ends: 271 [2019-02-28 10:48:41,686 INFO L226 Difference]: Without dead ends: 270 [2019-02-28 10:48:41,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:48:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-28 10:48:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-28 10:48:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-28 10:48:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-28 10:48:41,693 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-28 10:48:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:41,694 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-28 10:48:41,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-28 10:48:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-28 10:48:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-28 10:48:41,695 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:41,696 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-28 10:48:41,696 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-28 10:48:41,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:41,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:41,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:44,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:44,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:44,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:44,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:44,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:44,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:44,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:44,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:44,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:44,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-28 10:48:44,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:44,292 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:44,293 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:44,301 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:44,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:46,979 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:51,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:51,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-28 10:48:51,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:51,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:48:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:48:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:48:51,141 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-28 10:48:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:51,709 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-28 10:48:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:48:51,710 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-28 10:48:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:51,711 INFO L225 Difference]: With dead ends: 275 [2019-02-28 10:48:51,711 INFO L226 Difference]: Without dead ends: 274 [2019-02-28 10:48:51,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:48:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-28 10:48:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-28 10:48:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-28 10:48:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-28 10:48:51,717 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-28 10:48:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:51,717 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-28 10:48:51,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:48:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-28 10:48:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-28 10:48:51,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:51,719 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-28 10:48:51,719 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-28 10:48:51,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:51,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:51,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:51,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:51,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:54,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:54,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:54,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:54,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:54,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:54,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:54,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:54,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 211 conjunts are in the unsatisfiable core [2019-02-28 10:48:54,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:54,445 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:54,446 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:54,459 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:54,459 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:57,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:01,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-28 10:49:01,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:01,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-28 10:49:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-28 10:49:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:49:01,378 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-28 10:49:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:02,036 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-28 10:49:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:49:02,037 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-28 10:49:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:02,038 INFO L225 Difference]: With dead ends: 279 [2019-02-28 10:49:02,038 INFO L226 Difference]: Without dead ends: 278 [2019-02-28 10:49:02,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:49:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-28 10:49:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-28 10:49:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-28 10:49:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-28 10:49:02,046 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-28 10:49:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:02,046 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-28 10:49:02,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-28 10:49:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-28 10:49:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-28 10:49:02,048 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:02,048 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-28 10:49:02,048 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-28 10:49:02,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:02,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:04,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:04,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:04,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:04,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:04,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:04,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:04,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:04,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:04,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-28 10:49:04,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:04,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:49:04,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:04,968 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:04,968 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:04,979 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:04,979 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:07,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-28 10:49:11,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:11,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-28 10:49:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-28 10:49:11,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:49:11,929 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-28 10:49:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:12,491 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-28 10:49:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:49:12,492 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-28 10:49:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:12,494 INFO L225 Difference]: With dead ends: 283 [2019-02-28 10:49:12,494 INFO L226 Difference]: Without dead ends: 282 [2019-02-28 10:49:12,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:49:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-28 10:49:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-28 10:49:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-28 10:49:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-28 10:49:12,501 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-28 10:49:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:12,502 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-28 10:49:12,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-28 10:49:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-28 10:49:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-28 10:49:12,503 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:12,503 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-28 10:49:12,504 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-28 10:49:12,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:12,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:12,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:12,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:12,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:15,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:15,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:15,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:15,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:15,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:15,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:15,319 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:15,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:15,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:15,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:15,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-28 10:49:15,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:15,422 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:15,422 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:15,435 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:15,435 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:18,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-28 10:49:22,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:22,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:49:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:49:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:49:22,428 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-28 10:49:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:23,058 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-28 10:49:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:49:23,059 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-28 10:49:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:23,060 INFO L225 Difference]: With dead ends: 287 [2019-02-28 10:49:23,061 INFO L226 Difference]: Without dead ends: 286 [2019-02-28 10:49:23,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:49:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-28 10:49:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-28 10:49:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-28 10:49:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-28 10:49:23,066 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-28 10:49:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:23,067 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-28 10:49:23,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:49:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-28 10:49:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-28 10:49:23,068 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:23,068 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-28 10:49:23,068 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-28 10:49:23,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:23,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:23,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:25,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:25,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:25,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:25,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:25,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:25,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:25,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:25,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 220 conjunts are in the unsatisfiable core [2019-02-28 10:49:25,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:25,898 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:25,898 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:25,911 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:25,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:28,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:33,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-28 10:49:33,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:33,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-28 10:49:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-28 10:49:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:49:33,085 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-28 10:49:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:33,748 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-28 10:49:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:49:33,748 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-28 10:49:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:33,750 INFO L225 Difference]: With dead ends: 291 [2019-02-28 10:49:33,750 INFO L226 Difference]: Without dead ends: 290 [2019-02-28 10:49:33,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:49:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-28 10:49:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-28 10:49:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-28 10:49:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-28 10:49:33,756 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-28 10:49:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:33,756 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-28 10:49:33,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-28 10:49:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-28 10:49:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-28 10:49:33,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:33,758 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-28 10:49:33,758 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-28 10:49:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:33,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:33,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:36,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:36,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:36,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:36,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:36,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:36,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:36,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:36,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:36,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-28 10:49:36,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:36,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-28 10:49:36,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:36,770 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:36,770 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:36,778 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:36,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:39,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:44,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:44,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-28 10:49:44,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:44,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-28 10:49:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-28 10:49:44,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:49:44,007 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-28 10:49:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:44,734 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-28 10:49:44,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:49:44,734 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-28 10:49:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:44,736 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:49:44,736 INFO L226 Difference]: Without dead ends: 294 [2019-02-28 10:49:44,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:49:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-28 10:49:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-28 10:49:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-28 10:49:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-28 10:49:44,743 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-28 10:49:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:44,743 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-28 10:49:44,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-28 10:49:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-28 10:49:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-28 10:49:44,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:44,745 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-28 10:49:44,745 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-28 10:49:44,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:44,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:44,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:44,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:47,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:47,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:47,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:47,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:47,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:47,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:47,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:47,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:47,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:49:47,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:47,504 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:47,505 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,520 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:50,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:55,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-28 10:49:55,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:55,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:49:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:49:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:49:55,060 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-28 10:49:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:55,801 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-28 10:49:55,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:49:55,801 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-28 10:49:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:55,803 INFO L225 Difference]: With dead ends: 299 [2019-02-28 10:49:55,803 INFO L226 Difference]: Without dead ends: 298 [2019-02-28 10:49:55,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:49:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-28 10:49:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-28 10:49:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-28 10:49:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-28 10:49:55,810 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-28 10:49:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:55,810 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-28 10:49:55,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:49:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-28 10:49:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-28 10:49:55,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:55,812 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-28 10:49:55,812 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-28 10:49:55,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:55,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:55,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:55,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:55,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:58,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:58,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:58,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:58,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:58,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:58,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:58,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:58,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:58,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 229 conjunts are in the unsatisfiable core [2019-02-28 10:49:58,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:58,710 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:58,710 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:58,718 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:58,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:02,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:06,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:06,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-28 10:50:06,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:06,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-28 10:50:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-28 10:50:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:50:06,577 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-28 10:50:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:07,133 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-28 10:50:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:50:07,133 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-28 10:50:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:07,135 INFO L225 Difference]: With dead ends: 303 [2019-02-28 10:50:07,135 INFO L226 Difference]: Without dead ends: 302 [2019-02-28 10:50:07,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:50:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-28 10:50:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-28 10:50:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-28 10:50:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-28 10:50:07,141 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-28 10:50:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:07,142 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-28 10:50:07,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-28 10:50:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-28 10:50:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-28 10:50:07,143 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:07,143 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-28 10:50:07,143 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:07,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-28 10:50:07,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:07,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:07,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:07,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:10,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:10,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:10,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:10,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:10,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:10,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:10,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:10,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-28 10:50:10,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:10,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-28 10:50:10,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:10,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:10,440 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:10,457 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:10,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:13,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:17,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:17,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-28 10:50:17,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:17,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-28 10:50:17,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-28 10:50:17,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:50:17,965 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-28 10:50:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:18,622 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-28 10:50:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:50:18,623 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-28 10:50:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:18,625 INFO L225 Difference]: With dead ends: 307 [2019-02-28 10:50:18,625 INFO L226 Difference]: Without dead ends: 306 [2019-02-28 10:50:18,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:50:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-28 10:50:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-28 10:50:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-28 10:50:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-28 10:50:18,631 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-28 10:50:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:18,632 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-28 10:50:18,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-28 10:50:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-28 10:50:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-28 10:50:18,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:18,634 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-28 10:50:18,634 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-28 10:50:18,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:18,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:18,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:18,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:21,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:21,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:21,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:21,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:21,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:21,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:21,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:21,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:21,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:21,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-28 10:50:21,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:21,799 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:21,799 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:21,809 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:21,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:25,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:29,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:29,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-28 10:50:29,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:29,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:50:29,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:50:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:50:29,360 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-28 10:50:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:29,991 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-28 10:50:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:50:29,992 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-28 10:50:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:29,993 INFO L225 Difference]: With dead ends: 311 [2019-02-28 10:50:29,993 INFO L226 Difference]: Without dead ends: 310 [2019-02-28 10:50:29,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:50:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-28 10:50:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-28 10:50:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-28 10:50:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-28 10:50:29,999 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-28 10:50:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:29,999 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-28 10:50:29,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:50:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-28 10:50:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-28 10:50:30,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:30,001 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-28 10:50:30,001 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-28 10:50:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:30,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:30,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:30,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:33,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:33,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:33,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:33,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:33,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:33,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:33,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:33,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:33,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 238 conjunts are in the unsatisfiable core [2019-02-28 10:50:33,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:33,298 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:33,298 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:33,312 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:33,312 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:36,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-28 10:50:41,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-28 10:50:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-28 10:50:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-28 10:50:41,153 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-28 10:50:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:41,790 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-28 10:50:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:50:41,790 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-28 10:50:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:41,792 INFO L225 Difference]: With dead ends: 315 [2019-02-28 10:50:41,792 INFO L226 Difference]: Without dead ends: 314 [2019-02-28 10:50:41,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-28 10:50:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-28 10:50:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-28 10:50:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-28 10:50:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-28 10:50:41,798 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-28 10:50:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:41,798 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-28 10:50:41,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-28 10:50:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-28 10:50:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-28 10:50:41,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:41,800 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-28 10:50:41,800 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:41,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-28 10:50:41,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:44,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:44,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:44,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:44,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:44,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:44,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:44,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:44,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:45,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-28 10:50:45,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:45,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-28 10:50:45,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:45,175 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:45,175 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:45,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:45,196 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:48,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-28 10:50:53,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:53,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-28 10:50:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-28 10:50:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:50:53,358 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-28 10:50:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:54,008 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-28 10:50:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:50:54,008 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-28 10:50:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:54,010 INFO L225 Difference]: With dead ends: 319 [2019-02-28 10:50:54,010 INFO L226 Difference]: Without dead ends: 318 [2019-02-28 10:50:54,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:50:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-28 10:50:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-28 10:50:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-28 10:50:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-28 10:50:54,016 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-28 10:50:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-28 10:50:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-28 10:50:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-28 10:50:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-28 10:50:54,018 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:54,018 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-28 10:50:54,018 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-28 10:50:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:54,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:54,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:57,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:57,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:57,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:57,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:57,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:57,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:57,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:57,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:57,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:57,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-28 10:50:57,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:57,462 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:57,462 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:57,473 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:57,473 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:01,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:05,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-28 10:51:05,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:51:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:51:05,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:51:05,341 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-28 10:51:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:06,093 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-28 10:51:06,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:51:06,093 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-28 10:51:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:06,095 INFO L225 Difference]: With dead ends: 323 [2019-02-28 10:51:06,095 INFO L226 Difference]: Without dead ends: 322 [2019-02-28 10:51:06,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:51:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-28 10:51:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-28 10:51:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-28 10:51:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-28 10:51:06,101 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-28 10:51:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:06,101 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-28 10:51:06,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:51:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-28 10:51:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-28 10:51:06,102 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:06,103 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-28 10:51:06,103 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-28 10:51:06,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:06,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:06,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:06,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:09,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:09,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:09,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:09,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:09,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:09,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:09,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:09,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:09,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 247 conjunts are in the unsatisfiable core [2019-02-28 10:51:09,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:09,368 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:09,368 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:09,381 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:09,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:13,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:17,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:17,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-28 10:51:17,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:17,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-28 10:51:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-28 10:51:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:51:17,491 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-28 10:51:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:18,181 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-28 10:51:18,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:51:18,181 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-28 10:51:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:18,183 INFO L225 Difference]: With dead ends: 327 [2019-02-28 10:51:18,183 INFO L226 Difference]: Without dead ends: 326 [2019-02-28 10:51:18,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:51:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-28 10:51:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-28 10:51:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-28 10:51:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-28 10:51:18,190 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-28 10:51:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:18,190 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-28 10:51:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-28 10:51:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-28 10:51:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-28 10:51:18,192 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:18,192 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-28 10:51:18,192 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-28 10:51:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:18,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:21,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:21,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:21,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:21,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:21,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:21,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:51:21,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:51:21,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-28 10:51:21,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:21,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-28 10:51:21,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:21,826 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:21,826 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:21,843 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:21,843 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:25,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-28 10:51:30,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:30,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-28 10:51:30,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-28 10:51:30,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-28 10:51:30,005 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-28 10:51:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:30,711 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-28 10:51:30,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:51:30,711 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-28 10:51:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:30,713 INFO L225 Difference]: With dead ends: 331 [2019-02-28 10:51:30,713 INFO L226 Difference]: Without dead ends: 330 [2019-02-28 10:51:30,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-28 10:51:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-28 10:51:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-28 10:51:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-28 10:51:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-28 10:51:30,719 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-28 10:51:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:30,719 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-28 10:51:30,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-28 10:51:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-28 10:51:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-28 10:51:30,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:30,720 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-28 10:51:30,721 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-28 10:51:30,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:30,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:30,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:34,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:34,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:34,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:34,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:34,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:34,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:34,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:51:34,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:51:34,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:51:34,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:34,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-28 10:51:34,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:34,206 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:34,206 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:34,216 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:34,216 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:38,262 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:42,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-28 10:51:42,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:42,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-28 10:51:42,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-28 10:51:42,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:51:42,775 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-28 10:51:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:43,471 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-28 10:51:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:51:43,471 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-28 10:51:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:43,472 INFO L225 Difference]: With dead ends: 335 [2019-02-28 10:51:43,472 INFO L226 Difference]: Without dead ends: 334 [2019-02-28 10:51:43,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:51:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-28 10:51:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-28 10:51:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-28 10:51:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-28 10:51:43,479 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-28 10:51:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:43,479 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-28 10:51:43,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-28 10:51:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-28 10:51:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-28 10:51:43,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:43,481 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-28 10:51:43,481 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-28 10:51:43,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:43,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:43,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:43,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:43,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:46,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:46,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:46,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:46,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:46,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:46,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:46,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:46,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:46,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 256 conjunts are in the unsatisfiable core [2019-02-28 10:51:46,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:46,802 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:46,802 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:46,812 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:46,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:50,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:55,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-28 10:51:55,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:55,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-28 10:51:55,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-28 10:51:55,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:51:55,546 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-28 10:51:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:56,238 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-28 10:51:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:51:56,238 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-28 10:51:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:56,241 INFO L225 Difference]: With dead ends: 339 [2019-02-28 10:51:56,241 INFO L226 Difference]: Without dead ends: 338 [2019-02-28 10:51:56,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:51:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-28 10:51:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-28 10:51:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-28 10:51:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-28 10:51:56,248 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-28 10:51:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:56,248 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-28 10:51:56,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-28 10:51:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-28 10:51:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-28 10:51:56,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:56,249 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-28 10:51:56,250 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-28 10:51:56,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:56,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:56,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:59,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:59,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:59,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:59,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:59,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:59,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:51:59,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:00,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-28 10:52:00,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:00,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-28 10:52:00,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:00,388 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:00,388 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,396 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:00,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:04,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:08,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:08,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-28 10:52:08,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:08,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-28 10:52:08,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-28 10:52:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:52:08,956 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-28 10:52:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:09,745 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-28 10:52:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:52:09,746 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-28 10:52:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:09,748 INFO L225 Difference]: With dead ends: 343 [2019-02-28 10:52:09,748 INFO L226 Difference]: Without dead ends: 342 [2019-02-28 10:52:09,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:52:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-28 10:52:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-28 10:52:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-28 10:52:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-28 10:52:09,755 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-28 10:52:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:09,756 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-28 10:52:09,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-28 10:52:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-28 10:52:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-28 10:52:09,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:09,758 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-28 10:52:09,758 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:09,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:09,758 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-28 10:52:09,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:09,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:09,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:09,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:09,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:13,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:13,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:13,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:13,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:13,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:13,431 INFO 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-28 10:52:13,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:52:13,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:52:13,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:52:13,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:13,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-28 10:52:13,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:13,562 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:13,563 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:13,574 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:13,575 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:17,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-28 10:52:22,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:22,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-28 10:52:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-28 10:52:22,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:52:22,171 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-28 10:52:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:23,075 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-28 10:52:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:52:23,075 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-28 10:52:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:23,078 INFO L225 Difference]: With dead ends: 347 [2019-02-28 10:52:23,078 INFO L226 Difference]: Without dead ends: 346 [2019-02-28 10:52:23,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:52:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-28 10:52:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-28 10:52:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-28 10:52:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-28 10:52:23,086 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-28 10:52:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:23,086 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-28 10:52:23,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-28 10:52:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-28 10:52:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-28 10:52:23,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:23,089 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-28 10:52:23,089 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-28 10:52:23,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:23,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:23,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:26,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:26,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:26,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:26,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:26,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:26,555 INFO 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-28 10:52:26,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:26,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:26,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 265 conjunts are in the unsatisfiable core [2019-02-28 10:52:26,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:26,680 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:26,680 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:26,691 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:26,691 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:31,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:35,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:35,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-28 10:52:35,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:35,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-28 10:52:35,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-28 10:52:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:52:35,720 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-28 10:52:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:36,511 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-28 10:52:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:52:36,512 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-28 10:52:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:36,514 INFO L225 Difference]: With dead ends: 351 [2019-02-28 10:52:36,514 INFO L226 Difference]: Without dead ends: 350 [2019-02-28 10:52:36,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:52:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-28 10:52:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-28 10:52:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-28 10:52:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-28 10:52:36,520 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-28 10:52:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:36,521 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-28 10:52:36,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-28 10:52:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-28 10:52:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-28 10:52:36,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:36,523 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-28 10:52:36,523 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-28 10:52:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:40,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:40,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:40,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:40,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:40,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:40,344 INFO 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-28 10:52:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:40,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:40,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-28 10:52:40,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:40,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-28 10:52:40,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:40,917 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:40,917 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,928 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,929 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:45,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:49,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:49,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-28 10:52:49,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:49,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-28 10:52:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-28 10:52:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-28 10:52:49,816 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-28 10:52:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:50,596 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-28 10:52:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:52:50,596 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-28 10:52:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:50,598 INFO L225 Difference]: With dead ends: 355 [2019-02-28 10:52:50,598 INFO L226 Difference]: Without dead ends: 354 [2019-02-28 10:52:50,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-28 10:52:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-28 10:52:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-28 10:52:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-28 10:52:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-28 10:52:50,604 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-28 10:52:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:50,604 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-28 10:52:50,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-28 10:52:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-28 10:52:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-28 10:52:50,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:50,605 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-28 10:52:50,606 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:50,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-28 10:52:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:50,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:54,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:54,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:54,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:54,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:54,674 INFO 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-28 10:52:54,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:52:54,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:52:54,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:52:54,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:54,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-28 10:52:54,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:54,804 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:54,804 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,813 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:59,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:03,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:03,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-28 10:53:03,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:03,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-28 10:53:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-28 10:53:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:53:03,648 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-28 10:53:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:04,454 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-28 10:53:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:53:04,454 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-28 10:53:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:04,456 INFO L225 Difference]: With dead ends: 359 [2019-02-28 10:53:04,456 INFO L226 Difference]: Without dead ends: 358 [2019-02-28 10:53:04,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:53:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-28 10:53:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-28 10:53:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-28 10:53:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-28 10:53:04,462 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-28 10:53:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:04,462 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-28 10:53:04,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-28 10:53:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-28 10:53:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-28 10:53:04,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:04,463 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-28 10:53:04,463 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-28 10:53:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:04,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:04,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:08,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:08,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:08,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:08,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:08,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:08,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 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-28 10:53:08,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:08,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:08,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 274 conjunts are in the unsatisfiable core [2019-02-28 10:53:08,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:08,171 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:08,171 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,182 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,183 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:12,833 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:17,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-28 10:53:17,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:17,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-28 10:53:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-28 10:53:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-28 10:53:17,326 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-28 10:53:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:18,184 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-28 10:53:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:53:18,185 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-28 10:53:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:18,187 INFO L225 Difference]: With dead ends: 363 [2019-02-28 10:53:18,187 INFO L226 Difference]: Without dead ends: 362 [2019-02-28 10:53:18,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-28 10:53:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-28 10:53:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-28 10:53:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-28 10:53:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-28 10:53:18,194 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-28 10:53:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:18,194 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-28 10:53:18,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-28 10:53:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-28 10:53:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-28 10:53:18,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:18,195 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-28 10:53:18,196 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-28 10:53:18,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:18,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:18,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:18,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:22,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:22,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:22,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:22,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:22,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:53:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:22,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:22,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-28 10:53:22,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:22,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-28 10:53:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:22,698 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:22,698 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,707 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,707 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:27,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:31,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-28 10:53:31,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:31,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-28 10:53:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-28 10:53:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:53:31,895 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-28 10:53:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:32,665 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-28 10:53:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:53:32,666 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-28 10:53:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:32,668 INFO L225 Difference]: With dead ends: 367 [2019-02-28 10:53:32,668 INFO L226 Difference]: Without dead ends: 366 [2019-02-28 10:53:32,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:53:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-28 10:53:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-28 10:53:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-28 10:53:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-28 10:53:32,675 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-28 10:53:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:32,675 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-28 10:53:32,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-28 10:53:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-28 10:53:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-28 10:53:32,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:32,677 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-28 10:53:32,677 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:32,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-28 10:53:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:32,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:32,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:32,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:36,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:36,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:36,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:36,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:36,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:36,694 INFO 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-28 10:53:36,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:36,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:36,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:36,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:36,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 280 conjunts are in the unsatisfiable core [2019-02-28 10:53:36,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:36,825 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:36,825 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:36,835 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:36,835 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:41,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:45,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:45,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-28 10:53:45,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-28 10:53:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-28 10:53:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:53:45,898 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-28 10:53:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:46,656 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-28 10:53:46,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:53:46,656 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-28 10:53:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:46,657 INFO L225 Difference]: With dead ends: 371 [2019-02-28 10:53:46,658 INFO L226 Difference]: Without dead ends: 370 [2019-02-28 10:53:46,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:53:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-28 10:53:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-28 10:53:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-28 10:53:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-28 10:53:46,665 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-28 10:53:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:46,665 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-28 10:53:46,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-28 10:53:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-28 10:53:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-28 10:53:46,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:46,667 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-28 10:53:46,667 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-28 10:53:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:46,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:46,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:46,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:50,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:50,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:50,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:50,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 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-28 10:53:50,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:50,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:50,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 283 conjunts are in the unsatisfiable core [2019-02-28 10:53:50,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:50,903 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:50,903 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:50,910 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:50,911 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:55,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:59,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-28 10:53:59,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:59,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-28 10:53:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-28 10:53:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:53:59,912 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-28 10:54:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:00,752 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-28 10:54:00,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:54:00,753 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-28 10:54:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:00,754 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:54:00,754 INFO L226 Difference]: Without dead ends: 374 [2019-02-28 10:54:00,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:54:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-28 10:54:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-28 10:54:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-28 10:54:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-28 10:54:00,761 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-28 10:54:00,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:00,761 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-28 10:54:00,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-28 10:54:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-28 10:54:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-28 10:54:00,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:00,763 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-28 10:54:00,763 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:00,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-28 10:54:00,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:00,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:00,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:00,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:04,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:04,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:04,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:04,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:04,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:04,599 INFO 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-28 10:54:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:54:04,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:54:05,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-28 10:54:05,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:54:05,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 286 conjunts are in the unsatisfiable core [2019-02-28 10:54:05,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:05,239 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:05,239 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:05,248 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:05,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:10,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:14,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:14,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-28 10:54:14,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:14,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-28 10:54:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-28 10:54:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-28 10:54:14,846 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-28 10:54:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:15,622 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-28 10:54:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:54:15,623 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-28 10:54:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:15,624 INFO L225 Difference]: With dead ends: 379 [2019-02-28 10:54:15,624 INFO L226 Difference]: Without dead ends: 378 [2019-02-28 10:54:15,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-28 10:54:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-28 10:54:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-28 10:54:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-28 10:54:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-28 10:54:15,631 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-28 10:54:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:15,631 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-28 10:54:15,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-28 10:54:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-28 10:54:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-28 10:54:15,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:15,633 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-28 10:54:15,633 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-28 10:54:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:15,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:54:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:15,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:19,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:19,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:19,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:19,625 INFO 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-28 10:54:19,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:54:19,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:54:19,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:54:19,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:54:19,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 289 conjunts are in the unsatisfiable core [2019-02-28 10:54:19,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:19,773 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:19,773 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:19,782 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:19,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:24,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:29,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:29,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-28 10:54:29,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-28 10:54:29,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-28 10:54:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:54:29,529 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-28 10:54:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:30,281 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-28 10:54:30,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:54:30,281 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-28 10:54:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:30,284 INFO L225 Difference]: With dead ends: 383 [2019-02-28 10:54:30,284 INFO L226 Difference]: Without dead ends: 382 [2019-02-28 10:54:30,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:54:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-28 10:54:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-28 10:54:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-28 10:54:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-28 10:54:30,291 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-28 10:54:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:30,291 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-28 10:54:30,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-28 10:54:30,291 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-28 10:54:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-28 10:54:30,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:30,293 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-28 10:54:30,293 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-28 10:54:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:30,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:54:30,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:30,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:34,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:34,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:34,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:34,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:34,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:34,611 INFO 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-28 10:54:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:34,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:34,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 292 conjunts are in the unsatisfiable core [2019-02-28 10:54:34,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:34,736 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:34,736 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:34,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:34,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:39,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:44,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:44,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-28 10:54:44,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:44,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-28 10:54:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-28 10:54:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-28 10:54:44,332 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-02-28 10:54:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:45,197 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-02-28 10:54:45,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:54:45,197 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-02-28 10:54:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:45,199 INFO L225 Difference]: With dead ends: 387 [2019-02-28 10:54:45,200 INFO L226 Difference]: Without dead ends: 386 [2019-02-28 10:54:45,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-28 10:54:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-28 10:54:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-02-28 10:54:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-02-28 10:54:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-02-28 10:54:45,206 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-02-28 10:54:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:45,207 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-02-28 10:54:45,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-28 10:54:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-02-28 10:54:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-02-28 10:54:45,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:45,208 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-02-28 10:54:45,209 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-02-28 10:54:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:45,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:49,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:49,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:49,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:54:49,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:54:49,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:49,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:54:49,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:54:49,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:54:50,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-28 10:54:50,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:54:50,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 295 conjunts are in the unsatisfiable core [2019-02-28 10:54:50,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:50,184 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:54:50,184 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:50,193 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:50,193 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:55,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:59,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:59,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-28 10:54:59,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:59,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-28 10:54:59,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-28 10:54:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:54:59,880 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-02-28 10:55:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:00,776 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-28 10:55:00,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:55:00,776 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-02-28 10:55:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:00,778 INFO L225 Difference]: With dead ends: 391 [2019-02-28 10:55:00,778 INFO L226 Difference]: Without dead ends: 390 [2019-02-28 10:55:00,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:55:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-28 10:55:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-02-28 10:55:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-02-28 10:55:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-02-28 10:55:00,784 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-02-28 10:55:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:00,785 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-02-28 10:55:00,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-28 10:55:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-02-28 10:55:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-02-28 10:55:00,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:00,787 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-02-28 10:55:00,787 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-02-28 10:55:00,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:00,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:55:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:00,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:05,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:05,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:05,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:05,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:05,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:05,363 INFO 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-28 10:55:05,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:55:05,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:55:05,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:55:05,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:55:05,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 298 conjunts are in the unsatisfiable core [2019-02-28 10:55:05,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:05,513 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:05,513 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:05,522 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:05,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:10,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:55:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:55:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-28 10:55:15,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:55:15,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-28 10:55:15,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-28 10:55:15,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:55:15,143 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-02-28 10:55:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:16,058 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-02-28 10:55:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:55:16,059 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-02-28 10:55:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:16,060 INFO L225 Difference]: With dead ends: 395 [2019-02-28 10:55:16,060 INFO L226 Difference]: Without dead ends: 394 [2019-02-28 10:55:16,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:55:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-02-28 10:55:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-02-28 10:55:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-02-28 10:55:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-02-28 10:55:16,072 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-02-28 10:55:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:16,072 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-02-28 10:55:16,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-28 10:55:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-02-28 10:55:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-02-28 10:55:16,075 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:16,075 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-02-28 10:55:16,075 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-02-28 10:55:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:16,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:16,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:55:16,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:16,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:20,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:20,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:20,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:20,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:55:20,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:55:20,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:55:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 301 conjunts are in the unsatisfiable core [2019-02-28 10:55:20,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:20,644 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:20,644 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:20,653 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:20,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:26,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:55:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:30,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:55:30,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-28 10:55:30,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:55:30,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-28 10:55:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-28 10:55:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:55:30,809 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-02-28 10:55:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:31,616 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-02-28 10:55:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:55:31,616 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-02-28 10:55:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:31,618 INFO L225 Difference]: With dead ends: 399 [2019-02-28 10:55:31,618 INFO L226 Difference]: Without dead ends: 398 [2019-02-28 10:55:31,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:55:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-02-28 10:55:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-02-28 10:55:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-28 10:55:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-28 10:55:31,625 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-02-28 10:55:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:31,626 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-28 10:55:31,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-28 10:55:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-28 10:55:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-28 10:55:31,627 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:31,627 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-02-28 10:55:31,627 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:31,628 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-02-28 10:55:31,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:31,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:55:31,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:31,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:36,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:36,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:36,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:36,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:36,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:36,334 INFO 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-28 10:55:36,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:55:36,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:55:37,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-28 10:55:37,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:55:37,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 304 conjunts are in the unsatisfiable core [2019-02-28 10:55:37,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:37,106 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:37,106 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:37,115 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:37,115 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:42,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:55:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:46,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:55:46,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-28 10:55:46,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:55:46,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-28 10:55:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-28 10:55:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-28 10:55:46,958 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-02-28 10:55:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:55:47,837 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-02-28 10:55:47,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:55:47,838 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-02-28 10:55:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:55:47,840 INFO L225 Difference]: With dead ends: 403 [2019-02-28 10:55:47,840 INFO L226 Difference]: Without dead ends: 402 [2019-02-28 10:55:47,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-28 10:55:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-28 10:55:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-02-28 10:55:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-02-28 10:55:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-02-28 10:55:47,846 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-02-28 10:55:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:55:47,847 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-02-28 10:55:47,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-28 10:55:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-02-28 10:55:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-02-28 10:55:47,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:55:47,849 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-02-28 10:55:47,849 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:55:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:55:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-02-28 10:55:47,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:55:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:47,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:55:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:55:47,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:55:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:55:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:52,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:52,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:55:52,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:55:52,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:55:52,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:55:52,361 INFO 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-28 10:55:52,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:55:52,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:55:52,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:55:52,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:55:52,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 307 conjunts are in the unsatisfiable core [2019-02-28 10:55:52,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:55:52,548 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:55:52,549 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:55:52,561 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:55:52,562 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:55:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:55:58,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:56:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:56:02,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:56:02,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-28 10:56:02,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:56:02,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-28 10:56:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-28 10:56:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:56:02,393 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-02-28 10:56:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:56:03,338 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-02-28 10:56:03,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:56:03,338 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-02-28 10:56:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:56:03,340 INFO L225 Difference]: With dead ends: 407 [2019-02-28 10:56:03,340 INFO L226 Difference]: Without dead ends: 406 [2019-02-28 10:56:03,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:56:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-02-28 10:56:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-02-28 10:56:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-02-28 10:56:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-02-28 10:56:03,347 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-02-28 10:56:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:56:03,347 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-02-28 10:56:03,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-28 10:56:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-02-28 10:56:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-02-28 10:56:03,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:56:03,350 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-02-28 10:56:03,350 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:56:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:56:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-02-28 10:56:03,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:56:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:03,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:56:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:56:03,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:56:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:56:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:56:07,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:56:07,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:56:07,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:56:07,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:56:07,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:56:07,899 INFO 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-28 10:56:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:56:07,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:56:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:56:08,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:56:08,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:56:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:56:08,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:56:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:56:12,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:56:12,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-02-28 10:56:12,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:56:12,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:56:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:56:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-02-28 10:56:12,442 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-02-28 10:56:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:56:13,947 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-02-28 10:56:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:56:13,947 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-02-28 10:56:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:56:13,949 INFO L225 Difference]: With dead ends: 408 [2019-02-28 10:56:13,949 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:56:13,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:56:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:56:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:56:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:56:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:56:13,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-02-28 10:56:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:56:13,952 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:56:13,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:56:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:56:13,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:56:13,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:56:14,077 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-02-28 10:56:16,930 WARN L181 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-28 10:56:16,937 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-02-28 10:56:16,937 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-02-28 10:56:16,937 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-02-28 10:56:16,938 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-02-28 10:56:16,938 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-02-28 10:56:16,938 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-02-28 10:56:16,940 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) 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_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .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 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .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 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 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .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 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .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-28 10:56:16,940 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-02-28 10:56:16,978 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:56:16 BoogieIcfgContainer [2019-02-28 10:56:16,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:56:16,979 INFO L168 Benchmark]: Toolchain (without parser) took 758394.86 ms. Allocated memory was 136.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 104.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-02-28 10:56:16,979 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:56:16,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.63 ms. Allocated memory is still 136.8 MB. Free memory was 104.1 MB in the beginning and 101.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:56:16,980 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 ms. Allocated memory is still 136.8 MB. Free memory was 101.9 MB in the beginning and 100.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:56:16,980 INFO L168 Benchmark]: RCFGBuilder took 342.33 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-28 10:56:16,981 INFO L168 Benchmark]: TraceAbstraction took 757952.32 ms. Allocated memory was 136.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 90.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-02-28 10:56:16,982 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 136.8 MB. Free memory is still 105.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.63 ms. Allocated memory is still 136.8 MB. Free memory was 104.1 MB in the beginning and 101.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.78 ms. Allocated memory is still 136.8 MB. Free memory was 101.9 MB in the beginning and 100.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 342.33 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 757952.32 ms. Allocated memory was 136.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 90.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: 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: 13]: 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])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 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 + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 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 + 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 + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 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 <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 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, 8 locations, 1 error locations. SAFE Result, 757.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 47.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 637.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s 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, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 14.5s SatisfiabilityAnalysisTime, 670.4s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...