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/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:15:29,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:15:29,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:15:29,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:15:29,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:15:29,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:15:29,354 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:15:29,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:15:29,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:15:29,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:15:29,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:15:29,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:15:29,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:15:29,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:15:29,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:15:29,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:15:29,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:15:29,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:15:29,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:15:29,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:15:29,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:15:29,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:15:29,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:15:29,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:15:29,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:15:29,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:15:29,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:15:29,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:15:29,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:15:29,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:15:29,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:15:29,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:15:29,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:15:29,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:15:29,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:15:29,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:15:29,401 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 [2019-02-28 10:15:29,422 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:15:29,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:15:29,424 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:15:29,424 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:15:29,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:15:29,425 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:15:29,425 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:15:29,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:15:29,425 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:15:29,425 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:15:29,426 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:15:29,426 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:15:29,426 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:15:29,426 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:15:29,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:15:29,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:15:29,427 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:15:29,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:15:29,427 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:15:29,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:15:29,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:15:29,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:15:29,428 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:15:29,428 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:15:29,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:15:29,429 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:15:29,429 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:15:29,429 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:15:29,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:15:29,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:15:29,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:15:29,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:15:29,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:15:29,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:15:29,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:15:29,431 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:15:29,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:15:29,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:15:29,431 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:15:29,432 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:15:29,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:15:29,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:15:29,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:15:29,479 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:15:29,479 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:15:29,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl [2019-02-28 10:15:29,480 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl' [2019-02-28 10:15:29,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:15:29,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:15:29,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:15:29,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:15:29,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:15:29,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,547 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:15:29,547 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:15:29,548 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:15:29,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:15:29,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:15:29,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:15:29,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:15:29,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... [2019-02-28 10:15:29,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:15:29,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:15:29,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:15:29,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:15:29,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:15:29,641 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 10:15:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:15:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:15:29,902 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:15:29,903 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:15:29,904 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:15:29 BoogieIcfgContainer [2019-02-28 10:15:29,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:15:29,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:15:29,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:15:29,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:15:29,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:15:29" (1/2) ... [2019-02-28 10:15:29,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c9a50a and model type GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:15:29, skipping insertion in model container [2019-02-28 10:15:29,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:15:29" (2/2) ... [2019-02-28 10:15:29,911 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalIntegerCakeWithArray.bpl [2019-02-28 10:15:29,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:15:29,927 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:15:29,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:15:29,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:15:29,970 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:15:29,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:15:29,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:15:29,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:15:29,971 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:15:29,971 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:15:29,971 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:15:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-28 10:15:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:15:29,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:29,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:15:29,994 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-02-28 10:15:30,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:30,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:30,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:30,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:30,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:30,435 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-02-28 10:15:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:30,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:15:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:15:30,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:15:30,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:15:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:15:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:15:30,458 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-28 10:15:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:30,531 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-02-28 10:15:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:15:30,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:15:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:30,545 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:15:30,545 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:15:30,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:15:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:15:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:15:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:15:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:15:30,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-02-28 10:15:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:30,583 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:15:30,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:15:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:15:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:15:30,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:30,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:15:30,585 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:30,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash 926592, now seen corresponding path program 1 times [2019-02-28 10:15:30,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:30,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:30,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:30,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:30,853 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-02-28 10:15:31,164 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-02-28 10:15:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:31,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:31,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:31,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:15:31,288 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6] [2019-02-28 10:15:31,323 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:15:31,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:15:31,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:15:31,401 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 5. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:15:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:31,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:15:31,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:31,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:31,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:31,454 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:15:31,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:31,633 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 10:15:31,657 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2019-02-28 10:15:31,674 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-28 10:15:31,675 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,698 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,746 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-02-28 10:15:31,837 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:15:31,838 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,861 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:15:31,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-02-28 10:15:31,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-28 10:15:31,936 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:32,029 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:32,127 INFO L315 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 10:15:32,237 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 10:15:32,238 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:82, output treesize:38 [2019-02-28 10:15:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:32,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:32,356 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:15:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-02-28 10:15:32,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:15:32,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:15:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:15:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:15:32,359 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-02-28 10:15:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:32,390 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 10:15:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:15:32,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:15:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:32,393 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:15:32,394 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:15:32,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:15:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:15:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:15:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:15:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:15:32,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-28 10:15:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:32,403 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:15:32,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:15:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:15:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:15:32,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:32,404 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:15:32,404 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 890456194, now seen corresponding path program 1 times [2019-02-28 10:15:32,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:32,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:32,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:32,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:32,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:15:32,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:15:32,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:15:32,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:15:32,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:15:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:15:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:15:32,505 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-02-28 10:15:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:32,518 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 10:15:32,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:15:32,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:15:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:32,519 INFO L225 Difference]: With dead ends: 7 [2019-02-28 10:15:32,519 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:15:32,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:15:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:15:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:15:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:15:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:15:32,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-28 10:15:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:32,521 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:15:32,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:15:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:15:32,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:15:32,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:15:32,985 WARN L181 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINVARIANTandASSERT(line 19) no Hoare annotation was computed. [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:15:32,989 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 26) no Hoare annotation was computed. [2019-02-28 10:15:32,990 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 23) the Hoare annotation is: (let ((.cse0 (select main_m main_cakeLeft)) (.cse1 (= main_eat main_cakeLeft))) (or (and (= .cse0 0) (= main_cakeLeft main_eat)) (and (not .cse1) (exists ((v_arrayElimCell_3 Int)) (let ((.cse2 (div v_arrayElimCell_3 2))) (and (<= 0 v_arrayElimCell_3) (<= (+ (div main_init 2) v_arrayElimCell_3) (+ .cse2 (select main_m main_cakeLeft))) (= .cse2 (select main_m main_eat)))))) (and (= (div main_init 2) (select main_m main_eat)) (not (= main_init .cse0)) .cse1))) [2019-02-28 10:15:32,990 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2019-02-28 10:15:33,000 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:15:33 BoogieIcfgContainer [2019-02-28 10:15:33,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:15:33,001 INFO L168 Benchmark]: Toolchain (without parser) took 3487.00 ms. Allocated memory was 141.6 MB in the beginning and 222.8 MB in the end (delta: 81.3 MB). Free memory was 109.0 MB in the beginning and 198.9 MB in the end (delta: -89.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:15:33,003 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:15:33,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-28 10:15:33,004 INFO L168 Benchmark]: Boogie Preprocessor took 21.10 ms. Allocated memory is still 141.6 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:15:33,005 INFO L168 Benchmark]: RCFGBuilder took 332.16 ms. Allocated memory is still 141.6 MB. Free memory was 105.9 MB in the beginning and 96.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-02-28 10:15:33,006 INFO L168 Benchmark]: TraceAbstraction took 3095.72 ms. Allocated memory was 141.6 MB in the beginning and 222.8 MB in the end (delta: 81.3 MB). Free memory was 96.3 MB in the beginning and 198.9 MB in the end (delta: -102.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:15:33,011 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.18 ms. Allocated memory is still 141.6 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.10 ms. Allocated memory is still 141.6 MB. Free memory was 107.2 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.16 ms. Allocated memory is still 141.6 MB. Free memory was 105.9 MB in the beginning and 96.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3095.72 ms. Allocated memory was 141.6 MB in the beginning and 222.8 MB in the end (delta: 81.3 MB). Free memory was 96.3 MB in the beginning and 198.9 MB in the end (delta: -102.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: loop invariant is valid and assertion always holds For all program executions holds that loop invariant is valid and assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m[cakeLeft] == 0 && cakeLeft == eat) || (!(eat == cakeLeft) && (exists v_arrayElimCell_3 : int :: (0 <= v_arrayElimCell_3 && init / 2 + v_arrayElimCell_3 <= v_arrayElimCell_3 / 2 + m[cakeLeft]) && v_arrayElimCell_3 / 2 == m[eat]))) || ((init / 2 == m[eat] && !(init == m[cakeLeft])) && eat == cakeLeft) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. SAFE Result, 3.0s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 10 SDslu, 1 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 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, 2 NumberOfFragments, 57 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 1 QuantifiedInterpolants, 869 SizeOfPredicates, 4 NumberOfNonLiveVariables, 8 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 4/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...