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_camel.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:54,476 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:54,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:54,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:54,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:54,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:54,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:54,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:54,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:54,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:54,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:54,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:54,506 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:54,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:54,508 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:54,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:54,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:54,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:54,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:54,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:54,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:54,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:54,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:54,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:54,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:54,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:54,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:54,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:54,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:54,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:54,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:54,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:54,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:54,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:54,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:54,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:54,530 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:54,553 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:54,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:54,554 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:54,554 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:54,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:54,554 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:54,555 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:54,555 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:54,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:54,556 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:54,556 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:54,556 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:54,556 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:54,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:54,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:54,558 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:54,559 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:54,559 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:54,559 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:54,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:54,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:54,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:54,561 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:54,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:54,561 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:54,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:54,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:54,562 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:54,562 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:54,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:54,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:54,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:54,563 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:54,563 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:54,563 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:54,563 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:54,563 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:54,564 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:54,564 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:54,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:54,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:54,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:54,614 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:54,615 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:54,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2019-03-04 16:23:54,617 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-03-04 16:23:54,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:54,659 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:54,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:54,660 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:54,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,697 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:54,698 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:54,698 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:54,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:54,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:54,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:54,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/1) ... [2019-03-04 16:23:54,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:54,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:54,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:54,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:54,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (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-03-04 16:23:54,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-03-04 16:23:54,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:23:54,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:23:55,007 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:55,007 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:23:55,009 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:55 BoogieIcfgContainer [2019-03-04 16:23:55,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:55,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:55,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:55,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:55,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:54" (1/2) ... [2019-03-04 16:23:55,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312ebf60 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:55, skipping insertion in model container [2019-03-04 16:23:55,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:55" (2/2) ... [2019-03-04 16:23:55,016 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bpl [2019-03-04 16:23:55,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:55,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:55,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:55,081 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:55,082 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:55,082 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:55,082 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:55,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:55,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:55,083 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:55,083 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:55,083 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:23:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:55,103 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:55,107 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:23:55,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:55,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:55,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,287 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:23:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:55,389 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-03-04 16:23:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:55,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:23:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:55,412 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:23:55,413 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:23:55,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:23:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:23:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:23:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:23:55,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:23:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:55,481 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:23:55,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:23:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:55,483 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:55,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:55,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-03-04 16:23:55,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,695 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:23:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:55,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:55,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:55,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:23:55,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:55,816 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:55,816 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-03-04 16:23:56,086 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-03-04 16:23:56,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2019-03-04 16:23:56,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:56,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-03-04 16:23:56,577 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-03-04 16:23:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:56,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:56,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:23:56,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:23:56,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:23:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:56,614 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-03-04 16:23:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,782 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-03-04 16:23:56,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:56,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:23:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,783 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:23:56,784 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:23:56,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:23:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:23:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:23:56,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-03-04 16:23:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,789 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:23:56,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:23:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:23:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:56,789 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,790 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-03-04 16:23:56,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 2 times [2019-03-04 16:23:56,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:57,246 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-03-04 16:23:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:23:57,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-03-04 16:23:57,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:57,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:57,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:57,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:23:57,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:57,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:57,330 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,353 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-03-04 16:23:57,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 52 [2019-03-04 16:23:57,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:23:57,804 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,805 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:69 [2019-03-04 16:23:58,037 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-03-04 16:23:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:23:58,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:23:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:23:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:23:58,058 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 9 states. [2019-03-04 16:23:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,128 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-03-04 16:23:58,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:58,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:23:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,129 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:23:58,129 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:23:58,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:23:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:23:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:23:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:23:58,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-03-04 16:23:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:23:58,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:23:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:23:58,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:23:58,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:23:58,266 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 10 [2019-03-04 16:23:58,270 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 17 19) the Hoare annotation is: (and (< i (+ end 1)) (= 42 (select a end))) [2019-03-04 16:23:58,270 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 21) no Hoare annotation was computed. [2019-03-04 16:23:58,271 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2019-03-04 16:23:58,271 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2019-03-04 16:23:58,271 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-03-04 16:23:58,271 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 20) no Hoare annotation was computed. [2019-03-04 16:23:58,282 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:23:58 BoogieIcfgContainer [2019-03-04 16:23:58,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:23:58,283 INFO L168 Benchmark]: Toolchain (without parser) took 3625.59 ms. Allocated memory was 131.6 MB in the beginning and 172.5 MB in the end (delta: 40.9 MB). Free memory was 106.9 MB in the beginning and 83.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 64.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:58,284 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 131.6 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:23:58,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 131.6 MB. Free memory was 106.9 MB in the beginning and 104.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:58,286 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 ms. Allocated memory is still 131.6 MB. Free memory was 104.7 MB in the beginning and 103.9 MB in the end (delta: 839.9 kB). Peak memory consumption was 839.9 kB. Max. memory is 7.1 GB. [2019-03-04 16:23:58,287 INFO L168 Benchmark]: RCFGBuilder took 281.12 ms. Allocated memory is still 131.6 MB. Free memory was 103.9 MB in the beginning and 95.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:58,288 INFO L168 Benchmark]: TraceAbstraction took 3272.62 ms. Allocated memory was 131.6 MB in the beginning and 172.5 MB in the end (delta: 40.9 MB). Free memory was 95.0 MB in the beginning and 83.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:23:58,293 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.21 ms. Allocated memory is still 131.6 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 131.6 MB. Free memory was 106.9 MB in the beginning and 104.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.84 ms. Allocated memory is still 131.6 MB. Free memory was 104.7 MB in the beginning and 103.9 MB in the end (delta: 839.9 kB). Peak memory consumption was 839.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 281.12 ms. Allocated memory is still 131.6 MB. Free memory was 103.9 MB in the beginning and 95.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3272.62 ms. Allocated memory was 131.6 MB in the beginning and 172.5 MB in the end (delta: 40.9 MB). Free memory was 95.0 MB in the beginning and 83.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: 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: 17]: Loop Invariant Derived loop invariant: i < end + 1 && 42 == a[end] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 32 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 5 NumberOfFragments, 11 HoareAnnotationTreeSize, 1 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 18 ConstructedInterpolants, 2 QuantifiedInterpolants, 859 SizeOfPredicates, 2 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...