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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:52:58,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:52:58,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:52:58,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:52:58,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:52:58,436 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:52:58,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:52:58,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:52:58,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:52:58,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:52:58,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:52:58,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:52:58,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:52:58,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:52:58,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:52:58,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:52:58,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:52:58,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:52:58,453 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:52:58,455 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:52:58,456 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:52:58,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:52:58,460 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:52:58,460 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:52:58,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:52:58,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:52:58,462 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:52:58,463 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:52:58,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:52:58,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:52:58,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:52:58,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:52:58,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:52:58,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:52:58,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:52:58,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:52:58,469 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-01-18 17:52:58,497 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:52:58,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:52:58,499 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:52:58,499 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:52:58,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:52:58,500 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:52:58,500 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:52:58,500 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:52:58,500 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:52:58,500 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:52:58,501 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:52:58,501 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:52:58,501 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:52:58,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:52:58,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:52:58,502 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:52:58,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:52:58,503 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:52:58,504 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:52:58,504 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:52:58,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:52:58,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:52:58,505 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:52:58,505 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:52:58,505 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:52:58,506 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:52:58,506 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:52:58,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:52:58,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:52:58,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:52:58,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:52:58,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:52:58,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:52:58,508 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:52:58,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:52:58,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:52:58,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:52:58,509 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:52:58,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:52:58,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:52:58,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:52:58,565 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:52:58,566 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:52:58,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-01-18 17:52:58,567 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-01-18 17:52:58,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:52:58,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:52:58,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:52:58,607 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:52:58,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,645 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-18 17:52:58,646 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-18 17:52:58,646 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-18 17:52:58,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:52:58,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:52:58,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:52:58,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:52:58,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:52:58,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-18 17:52:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-18 17:52:58,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-18 17:52:58,962 INFO L278 CfgBuilder]: Using library mode [2019-01-18 17:52:58,962 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-18 17:52:58,963 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:58 BoogieIcfgContainer [2019-01-18 17:52:58,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:52:58,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:52:58,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:52:58,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:52:58,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/2) ... [2019-01-18 17:52:58,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4bfd1d and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:52:58, skipping insertion in model container [2019-01-18 17:52:58,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:58" (2/2) ... [2019-01-18 17:52:58,971 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-01-18 17:52:58,981 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:52:58,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:52:59,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:52:59,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:52:59,041 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:52:59,041 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:52:59,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:52:59,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:52:59,041 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:52:59,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:52:59,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:52:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 17:52:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:52:59,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:52:59,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-01-18 17:52:59,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,617 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-18 17:52:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:52:59,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:52:59,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:52:59,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:52:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:52:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:52:59,703 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-01-18 17:52:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:52:59,802 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:52:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:52:59,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:52:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:52:59,817 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:52:59,818 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:52:59,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:52:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:52:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-01-18 17:52:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:52:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 17:52:59,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-01-18 17:52:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:52:59,852 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 17:52:59,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:52:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 17:52:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:52:59,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,853 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:52:59,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-01-18 17:52:59,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:00,364 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-18 17:53:00,673 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-18 17:53:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:00,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:00,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:00,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:53:00,678 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-01-18 17:53:00,744 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:53:00,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:53:01,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:53:01,519 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:53:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:01,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:53:01,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:01,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:01,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:01,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:01,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:01,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:01,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:01,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:01,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:01,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:53:02,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:53:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:53:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:53:02,067 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-01-18 17:53:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,346 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-18 17:53:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:53:02,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 17:53:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,348 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:53:02,348 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:53:02,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:53:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:53:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-18 17:53:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:53:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 17:53:02,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-01-18 17:53:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,353 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 17:53:02,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:53:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 17:53:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:53:02,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,354 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-01-18 17:53:02,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-01-18 17:53:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:02,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:02,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:02,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:02,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:02,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:53:02,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:02,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:02,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:02,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:02,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:02,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:02,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:02,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:02,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 17:53:03,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:53:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:53:03,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:03,063 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-01-18 17:53:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:03,129 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 17:53:03,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:53:03,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 17:53:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:03,130 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:53:03,132 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:53:03,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:53:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-18 17:53:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:53:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-18 17:53:03,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-01-18 17:53:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:03,136 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-18 17:53:03,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:53:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-18 17:53:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:53:03,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:03,137 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-01-18 17:53:03,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-01-18 17:53:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:03,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:03,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:03,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:03,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:03,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:03,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:03,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:03,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:03,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:03,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:03,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-18 17:53:04,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:04,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:53:04,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:53:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:53:04,035 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-01-18 17:53:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,159 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:53:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:53:04,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 17:53:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,160 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:53:04,160 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:53:04,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:53:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:53:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-18 17:53:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:53:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:53:04,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-18 17:53:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,163 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:53:04,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:53:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:53:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:53:04,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,164 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-01-18 17:53:04,164 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-01-18 17:53:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:04,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:04,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:04,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:04,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:04,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:04,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:04,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:04,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:04,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:04,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:04,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:04,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-01-18 17:53:05,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:53:05,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:53:05,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,299 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-01-18 17:53:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,401 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-18 17:53:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:53:05,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-01-18 17:53:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,402 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:53:05,402 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:53:05,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:53:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-18 17:53:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:53:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-18 17:53:05,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-01-18 17:53:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,407 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-18 17:53:05,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:53:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-18 17:53:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:53:05,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,408 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-01-18 17:53:05,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-01-18 17:53:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:05,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:05,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:53:05,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:05,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:05,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:05,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:05,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:06,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:06,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:06,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:06,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-01-18 17:53:06,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:53:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:53:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:53:06,331 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-01-18 17:53:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,490 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-18 17:53:06,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:53:06,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-01-18 17:53:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,492 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:53:06,492 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:53:06,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:53:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:53:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-18 17:53:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:53:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:53:06,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-01-18 17:53:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,498 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:53:06,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:53:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:53:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:53:06,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,499 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-01-18 17:53:06,499 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,499 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-01-18 17:53:06,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:06,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:06,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:06,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:06,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:06,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:06,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:06,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:06,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:07,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:07,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:07,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:07,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-01-18 17:53:07,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:53:07,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:53:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:07,433 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-01-18 17:53:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,650 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:53:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:53:07,651 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-01-18 17:53:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,651 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:53:07,652 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:53:07,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:53:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-18 17:53:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:53:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-18 17:53:07,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-18 17:53:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,658 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-18 17:53:07,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:53:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-18 17:53:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-18 17:53:07,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,658 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-01-18 17:53:07,659 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-01-18 17:53:07,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:08,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:08,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:08,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:08,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:08,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:08,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:08,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-01-18 17:53:08,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:08,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:53:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:53:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:53:08,613 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-01-18 17:53:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,103 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-18 17:53:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:53:09,104 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-01-18 17:53:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,105 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:53:09,105 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:53:09,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:53:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:53:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-18 17:53:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:53:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-18 17:53:09,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-01-18 17:53:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-18 17:53:09,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:53:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-18 17:53:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:53:09,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,112 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-01-18 17:53:09,113 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-01-18 17:53:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:09,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:09,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:09,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:09,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:09,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:53:09,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:09,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:09,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:09,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:09,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:09,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:09,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:09,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:09,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:09,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:10,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-01-18 17:53:10,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:10,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:53:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:53:10,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:10,231 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-01-18 17:53:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:10,589 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-18 17:53:10,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:53:10,590 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-01-18 17:53:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:10,591 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:53:10,591 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:53:10,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:53:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-18 17:53:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:53:10,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:53:10,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-01-18 17:53:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:10,597 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:53:10,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:53:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:53:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-18 17:53:10,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:10,598 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-01-18 17:53:10,598 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:10,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:10,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-01-18 17:53:10,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:10,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:10,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:11,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:11,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:11,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:11,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:11,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:11,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:11,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:11,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:11,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:11,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:11,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:11,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:11,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:11,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:11,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-01-18 17:53:11,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:11,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:53:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:53:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:53:11,760 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-01-18 17:53:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:12,023 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:53:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:53:12,024 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-01-18 17:53:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:12,025 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:53:12,025 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:53:12,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:53:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:53:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-18 17:53:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:53:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-18 17:53:12,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-01-18 17:53:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:12,031 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-18 17:53:12,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:53:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-18 17:53:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:53:12,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:12,032 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-01-18 17:53:12,033 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-01-18 17:53:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:12,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:12,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:12,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:12,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:12,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:12,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:12,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:12,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:12,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:12,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:12,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:12,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:12,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:12,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:12,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:12,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:12,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:12,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:13,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-01-18 17:53:13,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:13,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:53:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:53:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:13,342 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-01-18 17:53:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:13,682 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-18 17:53:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:53:13,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-01-18 17:53:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:13,684 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:53:13,684 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:53:13,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:53:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-18 17:53:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:53:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:53:13,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-01-18 17:53:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:13,690 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:53:13,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:53:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:53:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:53:13,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:13,691 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-01-18 17:53:13,691 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-01-18 17:53:13,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:14,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:14,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:14,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:14,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:14,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-18 17:53:14,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:14,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:14,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:14,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:14,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:14,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:14,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:14,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:14,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:14,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:15,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-01-18 17:53:15,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:15,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:53:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:53:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:53:15,152 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-01-18 17:53:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:15,499 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:53:15,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:53:15,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-01-18 17:53:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:15,502 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:53:15,502 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:53:15,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:53:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:53:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-18 17:53:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:53:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-18 17:53:15,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-01-18 17:53:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:15,508 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-18 17:53:15,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:53:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-18 17:53:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:53:15,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:15,509 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-01-18 17:53:15,509 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-01-18 17:53:15,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:15,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:15,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:15,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:16,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:16,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:16,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:16,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:16,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:16,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:16,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:16,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:16,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:16,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:16,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:16,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:16,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:16,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:16,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:16,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:16,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:16,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:16,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:16,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:17,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-01-18 17:53:17,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:17,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:53:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:53:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,161 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-01-18 17:53:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:17,642 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-18 17:53:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:53:17,642 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-01-18 17:53:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:17,643 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:53:17,644 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:53:17,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:53:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-18 17:53:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:53:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-18 17:53:17,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-01-18 17:53:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:17,650 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-18 17:53:17,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:53:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-18 17:53:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-18 17:53:17,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:17,652 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-01-18 17:53:17,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:17,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-01-18 17:53:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:18,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:18,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:18,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:18,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:18,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:18,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:18,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:18,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:18,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:18,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:18,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:18,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:19,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:19,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-01-18 17:53:19,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:19,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:53:19,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:53:19,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:53:19,716 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-01-18 17:53:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:20,475 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-18 17:53:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:53:20,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-01-18 17:53:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:20,477 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:53:20,477 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:53:20,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:53:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:53:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-01-18 17:53:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:53:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:53:20,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-01-18 17:53:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:20,485 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:53:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:53:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:53:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:53:20,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:20,486 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-01-18 17:53:20,486 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-01-18 17:53:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:20,750 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:53:21,023 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:53:21,865 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-18 17:53:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:21,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:21,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:21,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:21,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:21,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:21,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:21,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:21,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:53:21,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:21,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:21,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:21,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:21,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:22,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:22,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:22,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:22,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-01-18 17:53:23,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:23,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:53:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:53:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:23,581 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-01-18 17:53:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:24,255 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:53:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:53:24,256 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-01-18 17:53:24,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:24,257 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:53:24,257 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:53:24,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:53:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-18 17:53:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:53:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-18 17:53:24,263 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-01-18 17:53:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:24,263 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-18 17:53:24,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:53:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-18 17:53:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-18 17:53:24,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:24,264 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-01-18 17:53:24,264 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-01-18 17:53:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:24,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:24,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:24,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:24,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:24,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:24,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:24,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:24,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:24,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:24,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:24,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:24,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:24,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:24,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:25,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:25,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:25,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:25,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:25,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:25,931 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-18 17:53:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:26,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:26,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-01-18 17:53:26,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:26,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:53:26,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:53:26,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:53:26,970 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-01-18 17:53:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:27,489 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-18 17:53:27,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:53:27,489 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-01-18 17:53:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:27,490 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:53:27,490 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:53:27,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:53:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:53:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-18 17:53:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:53:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:53:27,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-01-18 17:53:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:27,497 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:53:27,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:53:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:53:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:53:27,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:27,498 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-01-18 17:53:27,498 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-01-18 17:53:27,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:27,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:27,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:27,749 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:53:28,004 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:53:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:28,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:28,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:28,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:28,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:28,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:28,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:28,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:28,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:28,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:28,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:29,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:29,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:29,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:29,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:29,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:30,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:30,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-01-18 17:53:30,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:30,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:53:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:53:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:30,145 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-01-18 17:53:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:31,051 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:53:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:53:31,052 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-01-18 17:53:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:31,052 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:53:31,053 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:53:31,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:53:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-01-18 17:53:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:53:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-18 17:53:31,059 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-01-18 17:53:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:31,059 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-18 17:53:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:53:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-18 17:53:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:53:31,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:31,060 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-01-18 17:53:31,061 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-01-18 17:53:31,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:31,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:31,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:31,329 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:31,587 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:53:31,887 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:32,187 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:32,521 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:33,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:33,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:33,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:33,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:33,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:33,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:33,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:33,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:33,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:53:33,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:33,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:33,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:33,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:33,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:33,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:33,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:33,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:33,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:33,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:33,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:34,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:34,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-01-18 17:53:34,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:53:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:53:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:53:34,972 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-01-18 17:53:35,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:35,809 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-18 17:53:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:53:35,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-01-18 17:53:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:35,810 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:53:35,810 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:53:35,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:53:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:53:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-18 17:53:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:53:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-18 17:53:35,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-01-18 17:53:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:35,817 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-18 17:53:35,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:53:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-18 17:53:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:53:35,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:35,818 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-01-18 17:53:35,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-01-18 17:53:35,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:35,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:35,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:36,026 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:36,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:36,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:36,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:36,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:36,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:36,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:36,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:36,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:36,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:36,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:36,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:36,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:36,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:36,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:36,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:37,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:37,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:37,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:37,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:37,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:38,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-01-18 17:53:38,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:38,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:53:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:53:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:38,449 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-01-18 17:53:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:39,466 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-18 17:53:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:53:39,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-01-18 17:53:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:39,467 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:53:39,467 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:53:39,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:53:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-18 17:53:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:53:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:53:39,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-01-18 17:53:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:39,473 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:53:39,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:53:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:53:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:53:39,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:39,474 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-01-18 17:53:39,474 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-01-18 17:53:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:39,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:39,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:39,632 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:53:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:40,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:40,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:40,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:40,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:40,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:40,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:40,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:40,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:40,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:40,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:40,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:40,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:41,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:41,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:41,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:41,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:41,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:42,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:42,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-01-18 17:53:42,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:42,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:53:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:53:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-18 17:53:42,414 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-01-18 17:53:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:43,271 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:53:43,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:53:43,272 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-01-18 17:53:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:43,273 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:53:43,273 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:53:43,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-01-18 17:53:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:53:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-18 17:53:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:53:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-18 17:53:43,278 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-01-18 17:53:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:43,279 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-18 17:53:43,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:53:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-18 17:53:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:53:43,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:43,280 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-01-18 17:53:43,280 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-01-18 17:53:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:43,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:44,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:44,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:44,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:44,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:44,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:44,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:44,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:44,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-18 17:53:44,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:44,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:44,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:44,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:44,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:44,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:44,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:44,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:44,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:44,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:44,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:46,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-01-18 17:53:46,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:46,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:53:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:53:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:46,198 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-01-18 17:53:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:47,248 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-18 17:53:47,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:53:47,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-01-18 17:53:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:47,250 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:53:47,250 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:53:47,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:53:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-18 17:53:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:53:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:53:47,257 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-01-18 17:53:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:47,257 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:53:47,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:53:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:53:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:53:47,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:47,259 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-01-18 17:53:47,259 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-01-18 17:53:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:48,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:48,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:48,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:48,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:48,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:48,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:48,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:48,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:48,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:48,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:48,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:48,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:48,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:48,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:48,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:48,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:48,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:50,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:50,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-01-18 17:53:50,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:50,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:53:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:53:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-18 17:53:50,293 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-01-18 17:53:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:51,395 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:53:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:53:51,398 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-01-18 17:53:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:51,398 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:53:51,399 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:53:51,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-01-18 17:53:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:53:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-01-18 17:53:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:53:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-18 17:53:51,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-01-18 17:53:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:51,404 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-18 17:53:51,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:53:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-18 17:53:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:53:51,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:51,405 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-01-18 17:53:51,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-01-18 17:53:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:51,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:51,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:51,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:51,668 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:53:51,857 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:53:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:52,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:52,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:52,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:52,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:52,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:52,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:52,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:52,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:52,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:52,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:52,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:52,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:52,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:53,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:53,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:53,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:53,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:54,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:54,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-01-18 17:53:54,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:54,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:53:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:53:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:54,988 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-01-18 17:53:56,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:56,133 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-18 17:53:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:53:56,134 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-01-18 17:53:56,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:56,135 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:53:56,135 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:53:56,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:53:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-01-18 17:53:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 17:53:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-18 17:53:56,141 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-01-18 17:53:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:56,141 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-18 17:53:56,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:53:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-18 17:53:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-18 17:53:56,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:56,142 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-01-18 17:53:56,142 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-01-18 17:53:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:56,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:56,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:56,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:57,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:57,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:57,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:57,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:57,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:57,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:57,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:57,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:57,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:53:57,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:57,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:57,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:53:57,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:57,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:57,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:53:58,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:53:58,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:53:58,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:53:58,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:53:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:58,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:59,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-01-18 17:53:59,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:59,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:53:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:53:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-18 17:53:59,877 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-01-18 17:54:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:01,334 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-18 17:54:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:54:01,334 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-01-18 17:54:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:01,335 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:54:01,335 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:54:01,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-01-18 17:54:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:54:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-01-18 17:54:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:54:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:54:01,341 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-01-18 17:54:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:01,341 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:54:01,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:54:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:54:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:54:01,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:01,342 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-01-18 17:54:01,342 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-01-18 17:54:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:01,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:01,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:01,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:01,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:02,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:02,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:02,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:02,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:02,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:02,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:02,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:02,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:02,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:02,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:02,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:02,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:02,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:02,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:02,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:03,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:03,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:03,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:03,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:06,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:06,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-01-18 17:54:06,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:06,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:54:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:54:06,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:54:06,424 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-01-18 17:54:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:07,799 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:54:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:54:07,800 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-01-18 17:54:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:07,801 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:54:07,801 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:54:07,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:54:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:54:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-01-18 17:54:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:54:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-18 17:54:07,806 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-01-18 17:54:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:07,806 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-18 17:54:07,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:54:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-18 17:54:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-18 17:54:07,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:07,807 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-01-18 17:54:07,807 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-01-18 17:54:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:07,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:08,009 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:54:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:08,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:08,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:08,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:08,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:08,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:08,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:08,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:08,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:08,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:08,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:08,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:08,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:09,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:09,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:09,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:09,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:09,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:11,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-01-18 17:54:11,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:11,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:54:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:54:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:54:11,694 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-01-18 17:54:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:13,142 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-18 17:54:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:54:13,142 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-01-18 17:54:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:13,143 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:54:13,143 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:54:13,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-01-18 17:54:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:54:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-18 17:54:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:54:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:54:13,149 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-01-18 17:54:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:13,150 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:54:13,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:54:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:54:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:54:13,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:13,151 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-01-18 17:54:13,151 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:13,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-01-18 17:54:13,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:14,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:14,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:14,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:14,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:14,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:14,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:54:14,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:14,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:14,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:14,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:14,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:14,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:15,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:15,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:15,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:15,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:15,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:17,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:17,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-01-18 17:54:17,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:17,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:54:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:54:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:17,493 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-01-18 17:54:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:19,271 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:54:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:54:19,271 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-01-18 17:54:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:19,272 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:54:19,272 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:54:19,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:54:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-18 17:54:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:54:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-18 17:54:19,276 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-01-18 17:54:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:19,276 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-18 17:54:19,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:54:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-18 17:54:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-18 17:54:19,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:19,277 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-01-18 17:54:19,277 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-01-18 17:54:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:19,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:19,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:20,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:20,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:20,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:20,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:20,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:20,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:20,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:20,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:20,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:20,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:20,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:20,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:20,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:20,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:20,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:21,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:21,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:21,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:21,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:21,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:23,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:23,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-01-18 17:54:23,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:23,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:54:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:54:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:54:23,891 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-01-18 17:54:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:25,336 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-18 17:54:25,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:54:25,336 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-01-18 17:54:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:25,337 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:54:25,337 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:54:25,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:54:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:54:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-01-18 17:54:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:54:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-18 17:54:25,343 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-01-18 17:54:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:25,343 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-18 17:54:25,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:54:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-18 17:54:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:54:25,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:25,344 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-01-18 17:54:25,344 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:25,344 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-01-18 17:54:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:25,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:25,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:26,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:26,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:26,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:26,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:26,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:26,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:26,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:26,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:26,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:26,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:26,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:26,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:26,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:27,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:27,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:27,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:27,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:30,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:30,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-01-18 17:54:30,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:30,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:54:30,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:54:30,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:30,091 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-01-18 17:54:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:31,524 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-18 17:54:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:54:31,525 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-01-18 17:54:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:31,526 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:54:31,526 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:54:31,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:54:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-01-18 17:54:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:54:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:54:31,531 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-01-18 17:54:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:31,531 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:54:31,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:54:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:54:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:54:31,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:31,532 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-01-18 17:54:31,532 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-01-18 17:54:31,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:31,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:31,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:31,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:31,792 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:54:31,967 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:54:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:33,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:33,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:33,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:33,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:33,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:33,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:33,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:33,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-18 17:54:33,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:33,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:33,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:33,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:33,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:34,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:34,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:34,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:34,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:37,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:37,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-01-18 17:54:37,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:37,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:54:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:54:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-18 17:54:37,041 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-01-18 17:54:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:39,085 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:54:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:54:39,086 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-01-18 17:54:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:39,087 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:54:39,087 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:54:39,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-01-18 17:54:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:54:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-01-18 17:54:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:54:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-18 17:54:39,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-01-18 17:54:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:39,093 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-18 17:54:39,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:54:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-18 17:54:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:54:39,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:39,094 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-01-18 17:54:39,094 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:39,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-01-18 17:54:39,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:39,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:39,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:39,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:40,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:40,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:40,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:40,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:40,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:40,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:40,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:40,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:40,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:40,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:40,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:40,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:40,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:40,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:41,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:41,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:41,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:41,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:41,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:44,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:44,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-01-18 17:54:44,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:44,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:54:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:54:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:44,445 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-01-18 17:54:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:46,060 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-18 17:54:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:54:46,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-01-18 17:54:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:46,061 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:54:46,061 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:54:46,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:54:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-18 17:54:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:54:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:54:46,066 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-01-18 17:54:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:46,067 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:54:46,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:54:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:54:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:54:46,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:46,068 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-01-18 17:54:46,068 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-01-18 17:54:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:46,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:46,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:46,307 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:54:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:47,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:47,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:47,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:47,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:47,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:47,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:47,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:47,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:47,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:47,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:47,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:47,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:47,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:49,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:49,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:49,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:49,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:49,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:52,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-01-18 17:54:52,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:54:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:54:52,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-18 17:54:52,017 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-01-18 17:54:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:54,061 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:54:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:54:54,061 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-01-18 17:54:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:54,062 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:54:54,062 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:54:54,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-01-18 17:54:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:54:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-01-18 17:54:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:54:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-18 17:54:54,067 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-01-18 17:54:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:54,067 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-18 17:54:54,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:54:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-18 17:54:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:54:54,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:54,068 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-01-18 17:54:54,068 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:54,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:54,069 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-01-18 17:54:54,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:54,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:54,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:54,245 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:54:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:55,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:55,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:55,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:55,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:55,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:55,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-18 17:54:55,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:55,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:55,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:54:55,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:55,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:55,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:54:57,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:54:57,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:54:57,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:54:57,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:54:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:57,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:00,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:00,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-01-18 17:55:00,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:00,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:55:00,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:55:00,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:55:00,073 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-01-18 17:55:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:02,732 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-18 17:55:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:55:02,732 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-01-18 17:55:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:02,733 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:55:02,733 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:55:02,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:55:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:55:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-01-18 17:55:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:55:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-18 17:55:02,738 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-01-18 17:55:02,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:02,738 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-18 17:55:02,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:55:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-18 17:55:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:55:02,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:02,739 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-01-18 17:55:02,739 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:02,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-01-18 17:55:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:02,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:02,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:02,934 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:55:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:04,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:04,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:04,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:04,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:04,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:04,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:04,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:04,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:04,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:04,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:04,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:04,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:04,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:04,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:06,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:06,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:06,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:06,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:06,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:09,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:09,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-01-18 17:55:09,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:55:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:55:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-18 17:55:09,263 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-01-18 17:55:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:11,500 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-18 17:55:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:55:11,500 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-01-18 17:55:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:11,501 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:55:11,502 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:55:11,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-01-18 17:55:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:55:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-01-18 17:55:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:55:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:55:11,506 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-01-18 17:55:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:11,506 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:55:11,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:55:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:55:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:55:11,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:11,507 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-01-18 17:55:11,508 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-01-18 17:55:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:11,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:11,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:11,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:11,747 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:55:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:12,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:12,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:12,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:12,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:12,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:12,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:13,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:13,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:13,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:13,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:13,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:15,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:15,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:15,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:15,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:15,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:18,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:18,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-01-18 17:55:18,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:18,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:55:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:55:18,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:55:18,196 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-01-18 17:55:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:20,710 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:55:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:55:20,716 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-01-18 17:55:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:20,717 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:55:20,717 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:55:20,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:55:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:55:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-01-18 17:55:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:55:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-18 17:55:20,721 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-01-18 17:55:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:20,722 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-18 17:55:20,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:55:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-18 17:55:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-18 17:55:20,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:20,722 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-01-18 17:55:20,722 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:20,723 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-01-18 17:55:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:20,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:20,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:22,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:22,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:22,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:22,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:22,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:22,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:22,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-18 17:55:22,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:22,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:22,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:22,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:22,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:22,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:24,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:24,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:24,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:24,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:24,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:27,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:27,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-01-18 17:55:27,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:27,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:55:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:55:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-18 17:55:27,885 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-01-18 17:55:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:30,910 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-18 17:55:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:55:30,910 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-01-18 17:55:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:30,911 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:55:30,911 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:55:30,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-01-18 17:55:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:55:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-18 17:55:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:55:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:55:30,916 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-01-18 17:55:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:30,916 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:55:30,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:55:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:55:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:55:30,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:30,917 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-01-18 17:55:30,917 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-01-18 17:55:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:30,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:30,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:31,196 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:55:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:32,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:32,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:32,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:32,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:32,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:32,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:32,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:32,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:32,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:32,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:32,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:32,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:32,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:32,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:34,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:34,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:34,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:34,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:34,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-01-18 17:55:38,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:55:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:55:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:38,408 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-01-18 17:55:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:41,279 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:55:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:55:41,280 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-01-18 17:55:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:41,281 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:55:41,281 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:55:41,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:55:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-01-18 17:55:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:55:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-18 17:55:41,286 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-01-18 17:55:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:41,286 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-18 17:55:41,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:55:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-18 17:55:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-18 17:55:41,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:41,287 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-01-18 17:55:41,287 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-01-18 17:55:41,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:41,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:41,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:41,545 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:55:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:43,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:43,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:43,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:43,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:43,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:43,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:43,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:43,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:43,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:43,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:43,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:43,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:43,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:45,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:45,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:45,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:45,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:45,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:49,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-01-18 17:55:49,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:49,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:55:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:55:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:55:49,201 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-01-18 17:55:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:52,015 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-18 17:55:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:55:52,016 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-01-18 17:55:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:52,017 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:55:52,017 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:55:52,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:55:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:55:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-01-18 17:55:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:55:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-18 17:55:52,023 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-01-18 17:55:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:52,023 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-18 17:55:52,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:55:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-18 17:55:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:55:52,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:52,024 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-01-18 17:55:52,024 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-01-18 17:55:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:52,225 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:55:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:53,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:53,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:53,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:53,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:53,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:53,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:53,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:53,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:53,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-18 17:55:53,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:53,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:53,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:55:53,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:53,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:53,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:55:56,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:55:56,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:55:56,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:55:56,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:55:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:56,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:00,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-01-18 17:56:00,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:00,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:56:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:56:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:56:00,286 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-01-18 17:56:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:03,635 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-18 17:56:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:56:03,636 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-01-18 17:56:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:03,637 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:56:03,637 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:56:03,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:56:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:56:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-01-18 17:56:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:56:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:56:03,642 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-01-18 17:56:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:03,642 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:56:03,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:56:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:56:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:56:03,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:03,643 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-01-18 17:56:03,643 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-01-18 17:56:03,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:03,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:03,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:03,912 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:56:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:05,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:05,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:05,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:05,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:05,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:05,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:05,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:05,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:05,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:05,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:05,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:05,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:56:05,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:05,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:05,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:56:08,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:56:08,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:08,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:08,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:56:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:08,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:12,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:12,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-01-18 17:56:12,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:12,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:56:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:56:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-18 17:56:12,431 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-01-18 17:56:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:15,286 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:56:15,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:56:15,286 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-01-18 17:56:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:15,287 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:56:15,288 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:56:15,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-01-18 17:56:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:56:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-01-18 17:56:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:56:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-18 17:56:15,293 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-01-18 17:56:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:15,293 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-18 17:56:15,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:56:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-18 17:56:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:56:15,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:15,294 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-01-18 17:56:15,294 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-01-18 17:56:15,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:15,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:15,557 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:56:15,816 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:56:16,096 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:56:16,378 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:56:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:17,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:17,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:17,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:17,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:17,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:17,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:18,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:18,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:18,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:18,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:56:18,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:18,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:18,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:56:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:56:20,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:20,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:20,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:56:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:20,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:25,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-01-18 17:56:25,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:25,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:56:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:56:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:56:25,084 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-01-18 17:56:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:29,061 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-18 17:56:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:56:29,061 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-01-18 17:56:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:29,063 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:56:29,063 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:56:29,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:56:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:56:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-01-18 17:56:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:56:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:56:29,068 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-01-18 17:56:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:29,069 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:56:29,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:56:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:56:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:56:29,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:29,070 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-01-18 17:56:29,070 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-01-18 17:56:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:29,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:29,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:29,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:29,330 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:56:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:31,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:31,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:31,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:31,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:31,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:31,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:31,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:31,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:31,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-18 17:56:31,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:31,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:31,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:56:31,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:31,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:31,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:56:33,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:56:33,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:33,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:33,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:56:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:33,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:38,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:38,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-01-18 17:56:38,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:38,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:56:38,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:56:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-18 17:56:38,533 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-01-18 17:56:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:43,099 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:56:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:56:43,100 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-01-18 17:56:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:43,101 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:56:43,101 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:56:43,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-01-18 17:56:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:56:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-18 17:56:43,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:56:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-18 17:56:43,105 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-01-18 17:56:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:43,105 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-18 17:56:43,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:56:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-18 17:56:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:56:43,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:43,106 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-01-18 17:56:43,106 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:43,106 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-01-18 17:56:43,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:43,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:43,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:43,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:43,314 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:56:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:45,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:45,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:45,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:45,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:45,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:45,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:45,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:45,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:45,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:45,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:45,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:45,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:56:45,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:45,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:45,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:56:47,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:56:47,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:47,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:47,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:56:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:47,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:52,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:52,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-01-18 17:56:52,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:52,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:56:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:56:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:52,711 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-01-18 17:56:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:57,321 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-18 17:56:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:56:57,322 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-01-18 17:56:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:57,323 INFO L225 Difference]: With dead ends: 92 [2019-01-18 17:56:57,323 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:56:57,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:56:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-18 17:56:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 17:56:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-18 17:56:57,329 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-01-18 17:56:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:57,329 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-18 17:56:57,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:56:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-18 17:56:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-18 17:56:57,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:57,330 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-01-18 17:56:57,330 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-01-18 17:56:57,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:57,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:57,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:57,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:57,579 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:56:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:59,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:59,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:59,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:59,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:59,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:59,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:59,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:59,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:59,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:59,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:56:59,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:56:59,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:56:59,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:57:02,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:57:02,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:02,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:02,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:57:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:02,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:07,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:07,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-01-18 17:57:07,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:07,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 17:57:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 17:57:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-18 17:57:07,418 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-01-18 17:57:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:10,985 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-18 17:57:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:57:10,986 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-01-18 17:57:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:10,986 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:57:10,987 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:57:10,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-01-18 17:57:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:57:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-01-18 17:57:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:57:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:57:10,991 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-01-18 17:57:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:10,991 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:57:10,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 17:57:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:57:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:57:10,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:10,992 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-01-18 17:57:10,992 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-01-18 17:57:10,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:10,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:10,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:11,260 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:57:11,527 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:57:11,723 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:57:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:13,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:13,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:13,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:13,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:13,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:13,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:13,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:13,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:13,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-18 17:57:13,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:13,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:13,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:57:13,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:13,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:13,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:57:17,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:57:17,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:17,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:17,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:57:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:17,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:22,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:22,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-01-18 17:57:22,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:57:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:57:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:57:22,497 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-01-18 17:57:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:26,385 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:57:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:57:26,385 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-01-18 17:57:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:26,386 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:57:26,386 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:57:26,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:57:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:57:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-18 17:57:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:57:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-18 17:57:26,390 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-01-18 17:57:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:26,390 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-18 17:57:26,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 17:57:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-18 17:57:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:57:26,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:26,391 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-01-18 17:57:26,391 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-01-18 17:57:26,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:26,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:26,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:26,631 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:57:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:28,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:28,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:28,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:28,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:28,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:28,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:28,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:28,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:28,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:28,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:28,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:28,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:57:28,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:28,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:28,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:57:31,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:57:31,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:31,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:31,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:57:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:31,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:37,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:37,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-01-18 17:57:37,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:37,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 17:57:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 17:57:37,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:57:37,255 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-01-18 17:57:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:41,671 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-18 17:57:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:57:41,672 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-01-18 17:57:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:41,673 INFO L225 Difference]: With dead ends: 98 [2019-01-18 17:57:41,673 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:57:41,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-01-18 17:57:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:57:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-01-18 17:57:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:57:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 17:57:41,678 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-01-18 17:57:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:41,678 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 17:57:41,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 17:57:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 17:57:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 17:57:41,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:41,679 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-01-18 17:57:41,679 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-01-18 17:57:41,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:41,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:41,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:41,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:41,943 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:57:42,183 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:57:42,365 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:57:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:44,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:44,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:44,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:44,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:44,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:44,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:44,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:44,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:44,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:44,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:57:44,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:44,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:44,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:57:47,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:57:47,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:57:47,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:57:47,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:57:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:47,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-01-18 17:57:53,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:53,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 17:57:53,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 17:57:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:57:53,415 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-01-18 17:57:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:57,636 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 17:57:57,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:57:57,636 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-01-18 17:57:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:57,637 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:57:57,637 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:57:57,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:57:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:57:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-18 17:57:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 17:57:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-18 17:57:57,642 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-01-18 17:57:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-18 17:57:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 17:57:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-18 17:57:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 17:57:57,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:57,643 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-01-18 17:57:57,643 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-01-18 17:57:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:57,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:57,921 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:57:58,127 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 17:58:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:00,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:00,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:00,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:00,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:00,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:00,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-18 17:58:00,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:00,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:00,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:58:00,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:00,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:58:04,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:58:04,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:04,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:04,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:58:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:04,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:10,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:10,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-01-18 17:58:10,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:10,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 17:58:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 17:58:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-18 17:58:10,346 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-01-18 17:58:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:14,530 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-18 17:58:14,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:58:14,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-01-18 17:58:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:14,531 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:58:14,532 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:58:14,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-01-18 17:58:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:58:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-18 17:58:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:58:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-18 17:58:14,538 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-01-18 17:58:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:14,538 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-18 17:58:14,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 17:58:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-18 17:58:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 17:58:14,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:14,539 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-01-18 17:58:14,540 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-01-18 17:58:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:14,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:14,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:14,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:16,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:16,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:16,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:16,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:16,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:16,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:16,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:16,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:16,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:16,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:16,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:16,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:58:16,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:16,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:16,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:58:20,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:58:20,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:20,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:20,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:58:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:20,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:26,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-01-18 17:58:26,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:26,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 17:58:26,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 17:58:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:58:26,561 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-01-18 17:58:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:30,877 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-18 17:58:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:58:30,877 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-01-18 17:58:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:30,878 INFO L225 Difference]: With dead ends: 104 [2019-01-18 17:58:30,878 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:58:30,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:58:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:58:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-18 17:58:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 17:58:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 17:58:30,885 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-01-18 17:58:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:30,886 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 17:58:30,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 17:58:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 17:58:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 17:58:30,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:30,887 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-01-18 17:58:30,887 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-01-18 17:58:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:30,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:30,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:30,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:33,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:33,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:33,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:33,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:33,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:33,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:33,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:33,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:33,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:33,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:58:33,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:33,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:33,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:58:36,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:58:36,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:36,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:36,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:58:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:37,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:43,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-01-18 17:58:43,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 17:58:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 17:58:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:58:43,470 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-01-18 17:58:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:48,059 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 17:58:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:58:48,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-01-18 17:58:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:48,061 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:58:48,061 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:58:48,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-01-18 17:58:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:58:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-18 17:58:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 17:58:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-18 17:58:48,067 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-01-18 17:58:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:48,068 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-18 17:58:48,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 17:58:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-18 17:58:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 17:58:48,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:48,069 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-01-18 17:58:48,069 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:48,069 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-01-18 17:58:48,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:48,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:48,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:48,370 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:58:48,614 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:58:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:50,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:50,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:50,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:50,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:50,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:50,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:50,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:50,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:51,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-18 17:58:51,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:51,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:51,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:58:51,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:51,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:51,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:58:55,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:58:55,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:58:55,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:58:55,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:58:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:55,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-01-18 17:59:01,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:01,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 17:59:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 17:59:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:59:01,655 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-01-18 17:59:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:07,753 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-18 17:59:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:59:07,753 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-01-18 17:59:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:07,754 INFO L225 Difference]: With dead ends: 108 [2019-01-18 17:59:07,754 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:59:07,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:59:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:59:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-18 17:59:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 17:59:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 17:59:07,761 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-01-18 17:59:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:07,761 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 17:59:07,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 17:59:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 17:59:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 17:59:07,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:07,762 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-01-18 17:59:07,762 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-01-18 17:59:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:07,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:07,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:10,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:10,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:10,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:10,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:10,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:10,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:10,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:10,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:10,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:10,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:10,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:10,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:59:10,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:10,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:10,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:59:14,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:59:14,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:14,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:14,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:59:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:14,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:21,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:21,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-01-18 17:59:21,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:21,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-18 17:59:21,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-18 17:59:21,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 17:59:21,502 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-01-18 17:59:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:28,442 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 17:59:28,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:59:28,442 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-01-18 17:59:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:28,443 INFO L225 Difference]: With dead ends: 110 [2019-01-18 17:59:28,444 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:59:28,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-01-18 17:59:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:59:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-18 17:59:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:59:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-18 17:59:28,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-01-18 17:59:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:28,451 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-18 17:59:28,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-18 17:59:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-18 17:59:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 17:59:28,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:28,452 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-01-18 17:59:28,452 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-01-18 17:59:28,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:28,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:28,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:31,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:31,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:31,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:31,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:31,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:31,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:31,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:31,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:31,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:31,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:59:31,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:31,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:31,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:59:35,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:59:35,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:35,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:35,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:59:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:35,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:43,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-01-18 17:59:43,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:43,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 17:59:43,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 17:59:43,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:59:43,029 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-01-18 17:59:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:47,861 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-18 17:59:47,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:59:47,861 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-01-18 17:59:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:47,862 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:59:47,862 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:59:47,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:59:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:59:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-01-18 17:59:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-18 17:59:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-18 17:59:47,868 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-01-18 17:59:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:47,868 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-18 17:59:47,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 17:59:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-18 17:59:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-18 17:59:47,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:47,869 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-01-18 17:59:47,869 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:47,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-01-18 17:59:47,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:47,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:47,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:47,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:48,146 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:59:48,387 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 17:59:48,654 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:59:48,930 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 17:59:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:51,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:51,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:51,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:51,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:51,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:51,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:51,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:51,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:51,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-18 17:59:51,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:51,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:51,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 17:59:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:51,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:51,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 17:59:55,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 17:59:55,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:59:55,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:59:55,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 17:59:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:55,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:03,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:03,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-01-18 18:00:03,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:03,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 18:00:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 18:00:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 18:00:03,139 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-01-18 18:00:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:09,427 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-18 18:00:09,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 18:00:09,427 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-01-18 18:00:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:09,428 INFO L225 Difference]: With dead ends: 114 [2019-01-18 18:00:09,428 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 18:00:09,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-01-18 18:00:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 18:00:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-18 18:00:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 18:00:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 18:00:09,435 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-01-18 18:00:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:09,435 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 18:00:09,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 18:00:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 18:00:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 18:00:09,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:09,436 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-01-18 18:00:09,436 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:09,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-01-18 18:00:09,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:09,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:09,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:09,723 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:00:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:12,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:12,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:12,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:12,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:12,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:12,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:12,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:12,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:12,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:12,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:12,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:00:12,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:12,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:12,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:00:16,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:00:16,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:16,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:16,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:00:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:17,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:24,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:24,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-01-18 18:00:24,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:24,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-01-18 18:00:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-01-18 18:00:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 18:00:24,622 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-01-18 18:00:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:29,739 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 18:00:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 18:00:29,740 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-01-18 18:00:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:29,741 INFO L225 Difference]: With dead ends: 116 [2019-01-18 18:00:29,741 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 18:00:29,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 18:00:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 18:00:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-01-18 18:00:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 18:00:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-18 18:00:29,748 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-01-18 18:00:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:29,748 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-18 18:00:29,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-01-18 18:00:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-18 18:00:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-18 18:00:29,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:29,749 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-01-18 18:00:29,749 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-01-18 18:00:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:29,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:29,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:29,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:29,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:32,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:32,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:32,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:32,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:32,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:32,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:32,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:32,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:32,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:00:32,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:32,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:32,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:00:37,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:00:37,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:37,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:37,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:00:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:37,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:45,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:45,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-01-18 18:00:45,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:45,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-01-18 18:00:45,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-01-18 18:00:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 18:00:45,150 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-01-18 18:00:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:52,511 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-01-18 18:00:52,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 18:00:52,511 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-01-18 18:00:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:52,512 INFO L225 Difference]: With dead ends: 118 [2019-01-18 18:00:52,513 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 18:00:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-01-18 18:00:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 18:00:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-01-18 18:00:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-18 18:00:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-18 18:00:52,518 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-01-18 18:00:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:52,518 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-18 18:00:52,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-01-18 18:00:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-18 18:00:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-18 18:00:52,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:52,519 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-01-18 18:00:52,519 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-01-18 18:00:52,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:52,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:52,790 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:00:53,030 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 18:00:53,312 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:00:53,517 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:00:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:56,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:56,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:56,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:56,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:56,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:56,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:56,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:56,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-18 18:00:56,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:56,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:56,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:00:56,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:00:56,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:00:56,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:01:01,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:01:01,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:01,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:01,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:01:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:01,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:09,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:09,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-01-18 18:01:09,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:09,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-18 18:01:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-18 18:01:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:01:09,400 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-01-18 18:01:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:15,390 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-18 18:01:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 18:01:15,391 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-01-18 18:01:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:15,392 INFO L225 Difference]: With dead ends: 120 [2019-01-18 18:01:15,392 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 18:01:15,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:01:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 18:01:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-18 18:01:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-18 18:01:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-01-18 18:01:15,396 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-01-18 18:01:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:15,397 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-01-18 18:01:15,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-18 18:01:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-01-18 18:01:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-18 18:01:15,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:15,397 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-01-18 18:01:15,397 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-01-18 18:01:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:15,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:15,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:18,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:18,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:18,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:18,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:18,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:18,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:18,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:18,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:18,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:18,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:01:18,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:18,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:18,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:01:23,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:01:23,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:23,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:23,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:01:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:23,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:31,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:31,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-01-18 18:01:31,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:31,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-01-18 18:01:31,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-01-18 18:01:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 18:01:31,663 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-01-18 18:01:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:37,129 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-01-18 18:01:37,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 18:01:37,130 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-01-18 18:01:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:37,131 INFO L225 Difference]: With dead ends: 122 [2019-01-18 18:01:37,131 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 18:01:37,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 18:01:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 18:01:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-01-18 18:01:37,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-18 18:01:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-01-18 18:01:37,137 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-01-18 18:01:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:37,137 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-01-18 18:01:37,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-01-18 18:01:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-01-18 18:01:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-18 18:01:37,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:37,138 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-01-18 18:01:37,139 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-01-18 18:01:37,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:37,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:37,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:37,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:37,399 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 18:01:37,641 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 18:01:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:40,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:40,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:40,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:40,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:40,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:40,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:40,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:40,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:40,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:40,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:01:40,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:40,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:40,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:01:45,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:01:45,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:01:45,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:01:45,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:01:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:45,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:54,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:54,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-01-18 18:01:54,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:54,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-01-18 18:01:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-01-18 18:01:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:01:54,555 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-01-18 18:02:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:01,773 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-01-18 18:02:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 18:02:01,774 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-01-18 18:02:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:01,776 INFO L225 Difference]: With dead ends: 124 [2019-01-18 18:02:01,776 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 18:02:01,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:02:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 18:02:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-01-18 18:02:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-18 18:02:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-18 18:02:01,782 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-01-18 18:02:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:01,782 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-18 18:02:01,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-01-18 18:02:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-18 18:02:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-18 18:02:01,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:01,783 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-01-18 18:02:01,783 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-01-18 18:02:01,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:01,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:01,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:01,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:01,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:05,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:05,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:05,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:05,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:05,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:05,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:05,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:05,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:05,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-18 18:02:05,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:05,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:05,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:02:05,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:05,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:05,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:02:10,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:02:10,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:10,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:10,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:02:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:10,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:19,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-01-18 18:02:19,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:19,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-18 18:02:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-18 18:02:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 18:02:19,493 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-01-18 18:02:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:28,118 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-18 18:02:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 18:02:28,118 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-01-18 18:02:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:28,119 INFO L225 Difference]: With dead ends: 126 [2019-01-18 18:02:28,120 INFO L226 Difference]: Without dead ends: 125 [2019-01-18 18:02:28,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-01-18 18:02:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-18 18:02:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-01-18 18:02:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-18 18:02:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-01-18 18:02:28,126 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-01-18 18:02:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-01-18 18:02:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-18 18:02:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-01-18 18:02:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-18 18:02:28,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:28,128 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-01-18 18:02:28,128 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:28,128 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-01-18 18:02:28,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:28,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:28,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:28,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:28,399 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:02:28,655 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-18 18:02:28,933 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-18 18:02:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:32,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:32,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:32,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:32,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:32,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:32,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:32,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:32,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:32,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:32,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:32,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:32,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:02:32,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:32,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:32,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:02:37,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:02:37,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:37,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:37,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:02:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:37,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:46,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:46,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-01-18 18:02:46,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:46,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-01-18 18:02:46,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-01-18 18:02:46,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:02:46,795 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-01-18 18:02:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:55,824 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-01-18 18:02:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 18:02:55,824 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-01-18 18:02:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:55,825 INFO L225 Difference]: With dead ends: 128 [2019-01-18 18:02:55,825 INFO L226 Difference]: Without dead ends: 127 [2019-01-18 18:02:55,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:02:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-18 18:02:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-18 18:02:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-18 18:02:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-18 18:02:55,831 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-01-18 18:02:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:55,831 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-18 18:02:55,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-01-18 18:02:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-18 18:02:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-18 18:02:55,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:55,831 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-01-18 18:02:55,832 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:55,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-01-18 18:02:55,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:55,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:55,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:55,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:59,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:59,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:59,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:59,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:59,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:59,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:59,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:59,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:59,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:02:59,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:02:59,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:02:59,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:03:04,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:03:04,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:04,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:04,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:03:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:04,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:14,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:14,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-01-18 18:03:14,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:14,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-01-18 18:03:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-01-18 18:03:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-18 18:03:14,319 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-01-18 18:03:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:22,435 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-18 18:03:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 18:03:22,435 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-01-18 18:03:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:22,436 INFO L225 Difference]: With dead ends: 130 [2019-01-18 18:03:22,436 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 18:03:22,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-01-18 18:03:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 18:03:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-01-18 18:03:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-18 18:03:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-01-18 18:03:22,442 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-01-18 18:03:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:22,442 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-01-18 18:03:22,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-01-18 18:03:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-01-18 18:03:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-18 18:03:22,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:22,443 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-01-18 18:03:22,443 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-01-18 18:03:22,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:22,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:22,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:22,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:26,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:26,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:26,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:26,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:26,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:26,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:26,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:26,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:26,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-18 18:03:26,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:26,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:26,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:03:26,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:26,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:26,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:03:31,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:03:31,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:31,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:31,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:03:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:31,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:41,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:41,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-01-18 18:03:41,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:41,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-18 18:03:41,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-18 18:03:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:03:41,789 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-01-18 18:03:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:48,127 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-01-18 18:03:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 18:03:48,128 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-01-18 18:03:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:48,129 INFO L225 Difference]: With dead ends: 132 [2019-01-18 18:03:48,129 INFO L226 Difference]: Without dead ends: 131 [2019-01-18 18:03:48,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:03:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-18 18:03:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-18 18:03:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-18 18:03:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-01-18 18:03:48,136 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-01-18 18:03:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:48,136 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-01-18 18:03:48,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-18 18:03:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-01-18 18:03:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-18 18:03:48,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:48,137 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-01-18 18:03:48,138 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:48,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-01-18 18:03:48,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:48,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:48,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:51,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:51,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:51,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:51,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:51,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:51,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:03:51,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:03:51,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:03:51,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:51,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:51,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:03:51,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:51,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:51,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:03:57,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:03:57,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:03:57,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:03:57,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:03:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:57,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:07,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:07,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-01-18 18:04:07,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:07,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-01-18 18:04:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-01-18 18:04:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-18 18:04:07,735 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-01-18 18:04:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:15,675 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-01-18 18:04:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 18:04:15,675 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-01-18 18:04:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:15,676 INFO L225 Difference]: With dead ends: 134 [2019-01-18 18:04:15,676 INFO L226 Difference]: Without dead ends: 133 [2019-01-18 18:04:15,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-01-18 18:04:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-18 18:04:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-01-18 18:04:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-18 18:04:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-18 18:04:15,683 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-01-18 18:04:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:15,684 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-18 18:04:15,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-01-18 18:04:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-18 18:04:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-18 18:04:15,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:15,685 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-01-18 18:04:15,685 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-01-18 18:04:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:15,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:15,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:19,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:19,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:19,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:19,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:19,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:19,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:19,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:04:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:19,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:19,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:04:19,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:19,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:19,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:04:25,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:04:25,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:25,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:25,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:04:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:25,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:35,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:35,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-01-18 18:04:35,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:35,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-01-18 18:04:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-01-18 18:04:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:04:35,599 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-01-18 18:04:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:45,755 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-18 18:04:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 18:04:45,756 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-01-18 18:04:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:45,757 INFO L225 Difference]: With dead ends: 136 [2019-01-18 18:04:45,757 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 18:04:45,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:04:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 18:04:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-01-18 18:04:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-18 18:04:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-01-18 18:04:45,763 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-01-18 18:04:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:45,763 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-01-18 18:04:45,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-01-18 18:04:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-01-18 18:04:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-18 18:04:45,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:45,764 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-01-18 18:04:45,764 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:45,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-01-18 18:04:45,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:49,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:49,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:49,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:49,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:49,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:49,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:49,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:49,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-18 18:04:49,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:49,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:49,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:04:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:49,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:49,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:04:56,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:04:56,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:04:56,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:04:56,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:04:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:56,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:07,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:07,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-01-18 18:05:07,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:07,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-18 18:05:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-18 18:05:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-18 18:05:07,895 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-01-18 18:05:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:14,875 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-01-18 18:05:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 18:05:14,876 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-01-18 18:05:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:14,877 INFO L225 Difference]: With dead ends: 138 [2019-01-18 18:05:14,877 INFO L226 Difference]: Without dead ends: 137 [2019-01-18 18:05:14,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-01-18 18:05:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-18 18:05:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-18 18:05:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-18 18:05:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-18 18:05:14,882 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-01-18 18:05:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:14,882 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-18 18:05:14,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-18 18:05:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-18 18:05:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-18 18:05:14,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:14,883 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-01-18 18:05:14,883 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:14,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-01-18 18:05:14,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:14,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:14,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:18,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:18,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:18,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:18,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:18,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:18,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:18,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:18,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:18,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:18,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:18,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:05:18,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:18,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:18,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:05:25,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:05:25,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:25,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:25,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:05:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:25,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:36,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:36,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-01-18 18:05:36,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-18 18:05:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-18 18:05:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:05:36,203 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-01-18 18:05:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:46,328 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-18 18:05:46,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 18:05:46,328 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-01-18 18:05:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:46,330 INFO L225 Difference]: With dead ends: 140 [2019-01-18 18:05:46,330 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 18:05:46,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:05:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 18:05:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-01-18 18:05:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-18 18:05:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-01-18 18:05:46,338 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-01-18 18:05:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:46,338 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-01-18 18:05:46,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-18 18:05:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-01-18 18:05:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-18 18:05:46,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:46,339 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-01-18 18:05:46,339 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-01-18 18:05:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:46,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:46,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:50,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:50,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:50,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:50,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:50,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:50,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:50,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:50,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:05:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:50,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:50,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-18 18:05:50,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:50,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:50,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-01-18 18:05:56,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-01-18 18:05:56,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:05:56,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:05:56,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-01-18 18:05:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:56,872 INFO L316 TraceCheckSpWp]: Computing backward predicates...