java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:49:09,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:49:09,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:49:09,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:49:09,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:49:09,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:49:09,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:49:09,642 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:49:09,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:49:09,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:49:09,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:49:09,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:49:09,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:49:09,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:49:09,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:49:09,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:49:09,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:49:09,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:49:09,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:49:09,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:49:09,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:49:09,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:49:09,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:49:09,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:49:09,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:49:09,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:49:09,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:49:09,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:49:09,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:49:09,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:49:09,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:49:09,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:49:09,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:49:09,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:49:09,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:49:09,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:49:09,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:49:09,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:49:09,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:49:09,683 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:49:09,683 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:49:09,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:49:09,684 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:49:09,684 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:49:09,684 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:49:09,684 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:49:09,684 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:49:09,685 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:49:09,685 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:49:09,685 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:49:09,685 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:49:09,685 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:49:09,686 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:49:09,686 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:49:09,686 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:49:09,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:49:09,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:49:09,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:49:09,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:49:09,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:49:09,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:49:09,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:49:09,688 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:49:09,688 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:49:09,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:49:09,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:49:09,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:49:09,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:49:09,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:49:09,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:49:09,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:49:09,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:49:09,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:49:09,690 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:49:09,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:49:09,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:49:09,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:49:09,691 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:49:09,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:49:09,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:49:09,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:49:09,752 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:49:09,753 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:49:09,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2018-12-03 15:49:09,754 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2018-12-03 15:49:09,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:49:09,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:49:09,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:09,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:49:09,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:49:09,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:09,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:49:09,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:49:09,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:49:09,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/1) ... [2018-12-03 15:49:09,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:49:09,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:49:09,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:49:09,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:49:09,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (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 [2018-12-03 15:49:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:49:09,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:49:10,111 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:49:10,111 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:49:10,112 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:10 BoogieIcfgContainer [2018-12-03 15:49:10,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:49:10,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:49:10,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:49:10,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:49:10,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:09" (1/2) ... [2018-12-03 15:49:10,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9a9922 and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:49:10, skipping insertion in model container [2018-12-03 15:49:10,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:10" (2/2) ... [2018-12-03 15:49:10,120 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2018-12-03 15:49:10,131 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:49:10,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:49:10,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:49:10,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:49:10,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:49:10,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:49:10,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:49:10,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:49:10,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:49:10,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:49:10,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:49:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:49:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:49:10,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:10,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:49:10,235 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:10,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-03 15:49:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:10,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:49:10,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:10,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:49:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:49:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:10,409 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:49:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:10,455 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:49:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:49:10,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:49:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:10,467 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:49:10,467 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:49:10,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:49:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:49:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:49:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:49:10,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:49:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:49:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:49:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:49:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:49:10,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:10,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:49:10,505 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:10,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-03 15:49:10,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:10,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:10,644 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:49:10,647 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-03 15:49:10,690 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:49:10,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:49:10,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:49:10,832 INFO L272 AbstractInterpreter]: Visited 4 different actions 8 times. Merged at 1 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:49:10,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:10,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:49:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,849 INFO L192 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 [2018-12-03 15:49:10,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:10,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:11,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:49:11,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:11,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:49:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:49:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:49:11,019 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 15:49:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:11,067 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:49:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:49:11,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:49:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:11,069 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:49:11,069 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:49:11,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:49:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:49:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:49:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:49:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:49:11,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:49:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:11,073 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:49:11,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:49:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:49:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:49:11,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:11,074 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:49:11,075 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:11,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:11,075 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-12-03 15:49:11,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:11,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:11,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:11,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:11,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:11,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,156 INFO L192 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 [2018-12-03 15:49:11,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:11,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:11,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:49:11,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:11,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:11,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:49:11,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:11,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:49:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:49:11,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:11,278 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 15:49:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:11,291 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:49:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:49:11,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:49:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:11,293 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:49:11,293 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:49:11,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:49:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:49:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:49:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:49:11,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:49:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:11,296 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:49:11,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:49:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:49:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:49:11,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:11,297 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:49:11,297 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:11,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-12-03 15:49:11,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:11,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:11,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:11,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:11,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:11,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:11,416 INFO L192 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 [2018-12-03 15:49:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:11,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:11,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:11,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:11,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:11,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:11,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:49:11,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:11,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:49:11,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:49:11,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:49:11,810 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:49:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:11,853 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:49:11,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:49:11,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:49:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:11,855 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:49:11,855 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:49:11,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:49:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:49:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:49:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:49:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:49:11,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:49:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:11,861 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:49:11,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:49:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:49:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:49:11,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:11,862 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:49:11,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:11,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:11,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-12-03 15:49:11,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:11,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:11,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:12,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:12,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:12,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,005 INFO L192 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 [2018-12-03 15:49:12,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:12,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:12,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:12,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 15:49:12,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:49:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:49:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:12,229 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 15:49:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:12,258 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:49:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:49:12,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:49:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:12,259 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:49:12,259 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:49:12,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:49:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:49:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:49:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:49:12,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:49:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:12,263 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:49:12,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:49:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:49:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:49:12,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:12,264 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:49:12,264 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:12,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-12-03 15:49:12,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:12,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:12,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:12,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:12,345 INFO L192 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 [2018-12-03 15:49:12,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:12,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:12,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:49:12,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:12,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:12,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:12,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 15:49:12,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:12,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:49:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:49:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:12,836 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 15:49:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:12,867 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:49:12,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:49:12,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:49:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:12,870 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:49:12,870 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:49:12,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:49:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:49:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:49:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:49:12,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:49:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:12,876 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:49:12,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:49:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:49:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:49:12,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:12,877 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:49:12,879 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:12,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-12-03 15:49:12,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:12,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:12,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:13,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:13,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:13,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,041 INFO L192 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 [2018-12-03 15:49:13,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:13,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:13,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:13,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:13,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2018-12-03 15:49:13,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:13,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:49:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:49:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:13,289 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 15:49:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:13,313 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:49:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:49:13,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:49:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:13,314 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:49:13,314 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:49:13,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:49:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:49:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:49:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:49:13,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:49:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:13,319 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:49:13,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:49:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:49:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:49:13,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:13,320 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:49:13,321 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:13,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-12-03 15:49:13,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:13,434 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:13,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:13,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,435 INFO L192 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 [2018-12-03 15:49:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:13,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:13,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2018-12-03 15:49:13,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:13,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:49:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:49:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:13,636 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 15:49:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:13,676 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:49:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:49:13,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:49:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:13,677 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:49:13,677 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:49:13,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:49:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:49:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:49:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:49:13,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:49:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:13,683 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:49:13,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:49:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:49:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:49:13,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:13,684 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:49:13,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:13,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:13,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-12-03 15:49:13,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:13,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:13,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:13,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:13,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:13,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:13,898 INFO L192 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 [2018-12-03 15:49:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:13,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:13,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:49:13,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 15:49:14,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:14,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:49:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:49:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:14,146 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 15:49:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:14,170 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:49:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:49:14,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:49:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:14,172 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:49:14,172 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:49:14,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:49:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:49:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:49:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:49:14,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:49:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:14,176 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:49:14,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:49:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:49:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:49:14,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:14,177 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:49:14,177 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:14,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:14,178 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-12-03 15:49:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:14,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:14,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:14,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 15:49:14,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:14,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:49:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:49:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:49:14,318 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 15:49:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:14,355 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:49:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:49:14,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:49:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:14,356 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:49:14,357 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:49:14,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:49:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:49:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:49:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:49:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:49:14,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-12-03 15:49:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:14,360 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:49:14,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:49:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:49:14,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:49:14,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:49:14,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 22 30) no Hoare annotation was computed. [2018-12-03 15:49:14,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 22 30) no Hoare annotation was computed. [2018-12-03 15:49:14,461 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-03 15:49:14,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 22 30) no Hoare annotation was computed. [2018-12-03 15:49:14,462 INFO L444 ceAbstractionStarter]: At program point L25-1(lines 25 28) the Hoare annotation is: (or (<= 9 s) (and (<= i 0) (<= 0 s)) (and (<= 4 s) (<= i 4)) (and (<= i 1) (<= 1 s)) (and (<= 8 s) (<= i 8)) (and (<= i 7) (<= 7 s)) (and (<= i 3) (<= 3 s)) (and (<= 5 s) (<= i 5)) (and (<= i 6) (<= 6 s)) (and (<= i 2) (<= 2 s))) [2018-12-03 15:49:14,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-12-03 15:49:14,474 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:49:14 BoogieIcfgContainer [2018-12-03 15:49:14,474 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:49:14,475 INFO L168 Benchmark]: Toolchain (without parser) took 4680.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 309.3 MB). Peak memory consumption was 309.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:49:14,477 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:49:14,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:49:14,478 INFO L168 Benchmark]: Boogie Preprocessor took 24.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:49:14,479 INFO L168 Benchmark]: RCFGBuilder took 248.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:49:14,480 INFO L168 Benchmark]: TraceAbstraction took 4361.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:49:14,483 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 248.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4361.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 288.2 MB). Peak memory consumption was 288.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((((((((9 <= s || (i <= 0 && 0 <= s)) || (4 <= s && i <= 4)) || (i <= 1 && 1 <= s)) || (8 <= s && i <= 8)) || (i <= 7 && 7 <= s)) || (i <= 3 && 3 <= s)) || (5 <= s && i <= 5)) || (i <= 6 && 6 <= s)) || (i <= 2 && 2 <= s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 2 SDslu, 45 SDs, 0 SdLazy, 122 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 70 SyntacticMatches, 24 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 10 NumberOfFragments, 67 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 3479 SizeOfPredicates, 7 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 45/405 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...