java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:50:40,265 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:50:40,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:50:40,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:50:40,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:50:40,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:50:40,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:50:40,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:50:40,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:50:40,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:50:40,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:50:40,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:50:40,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:50:40,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:50:40,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:50:40,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:50:40,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:50:40,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:50:40,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:50:40,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:50:40,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:50:40,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:50:40,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:50:40,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:50:40,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:50:40,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:50:40,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:50:40,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:50:40,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:50:40,316 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:50:40,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:50:40,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:50:40,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:50:40,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:50:40,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:50:40,319 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:50:40,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:50:40,332 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:50:40,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:50:40,333 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:50:40,333 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:50:40,333 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:50:40,334 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:50:40,334 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:50:40,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:50:40,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:50:40,334 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:50:40,335 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:50:40,335 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:50:40,335 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:50:40,336 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:50:40,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:50:40,336 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:50:40,336 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:50:40,336 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:50:40,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:50:40,338 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:50:40,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:50:40,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:50:40,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:50:40,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:50:40,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:50:40,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:50:40,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:50:40,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:50:40,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:50:40,340 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:50:40,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:50:40,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:50:40,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:50:40,340 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:50:40,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:50:40,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:50:40,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:50:40,420 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:50:40,420 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:50:40,421 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:50:40,422 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HierarchicalTraceAbstraction/GeometricalIntegerCakeWithArray.bpl' [2019-02-28 10:50:40,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:50:40,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:50:40,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:50:40,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:50:40,469 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:50:40,485 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:50:40" (1/1) ... [2019-02-28 10:50:40,495 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:50:40" (1/1) ... [2019-02-28 10:50:40,501 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:50:40,501 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:50:40,502 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:50:40,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:50:40,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:50:40,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:50:40,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:50:40,515 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:50:40" (1/1) ... [2019-02-28 10:50:40,515 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:50:40" (1/1) ... [2019-02-28 10:50:40,516 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:50:40" (1/1) ... [2019-02-28 10:50:40,516 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:50:40" (1/1) ... [2019-02-28 10:50:40,521 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:50:40" (1/1) ... [2019-02-28 10:50:40,525 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:50:40" (1/1) ... [2019-02-28 10:50:40,526 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:50:40" (1/1) ... [2019-02-28 10:50:40,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:50:40,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:50:40,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:50:40,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:50:40,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:50:40" (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:50:40,591 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 10:50:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:50:40,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:50:40,845 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:50:40,846 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:50:40,847 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:50:40 BoogieIcfgContainer [2019-02-28 10:50:40,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:50:40,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:50:40,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:50:40,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:50:40,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:50:40" (1/2) ... [2019-02-28 10:50:40,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e650253 and model type GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:50:40, skipping insertion in model container [2019-02-28 10:50:40,853 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:50:40" (2/2) ... [2019-02-28 10:50:40,855 INFO L112 eAbstractionObserver]: Analyzing ICFG GeometricalIntegerCakeWithArray.bpl [2019-02-28 10:50:40,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:50:40,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:50:40,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:50:40,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:50:40,920 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:50:40,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:50:40,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:50:40,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:50:40,920 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:50:40,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:50:40,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:50:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-28 10:50:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:50:40,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:40,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:50:40,945 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-02-28 10:50:40,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:41,433 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-02-28 10:50:41,435 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:50:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:50:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:50:41,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:50:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:50:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:50:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:50:41,456 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-28 10:50:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:41,549 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-02-28 10:50:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:50:41,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:50:41,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:41,562 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:50:41,563 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:50:41,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:50:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:50:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:50:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:50:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:50:41,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-02-28 10:50:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:41,602 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:50:41,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:50:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:50:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:50:41,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:41,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:50:41,604 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 926592, now seen corresponding path program 1 times [2019-02-28 10:50:41,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:41,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:41,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:42,061 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-02-28 10:50:42,387 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-02-28 10:50:42,489 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:50:42,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:42,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:42,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:50:42,493 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6] [2019-02-28 10:50:42,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:50:42,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:50:42,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:50:42,974 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:50:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:42,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:50:42,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:42,983 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:50:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:43,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:43,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:50:43,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:43,186 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 10:50:43,200 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:50:43,205 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:50:43,206 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:43,212 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:50:43,218 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:43,265 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:50:43,282 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:50:43,283 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:43,320 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:50:43,371 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:50:43,383 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:50:43,384 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:43,468 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:50:43,583 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:50:43,629 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:50:43,630 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:82, output treesize:38 [2019-02-28 10:50:43,686 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:50:43,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:43,730 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:50:43,751 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:50:43,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2019-02-28 10:50:43,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:50:43,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:50:43,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:50:43,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:50:43,753 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-02-28 10:50:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:43,823 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 10:50:43,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:50:43,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:50:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:43,824 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:50:43,825 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:50:43,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:50:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:50:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:50:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:50:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:50:43,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-28 10:50:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:43,829 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:50:43,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:50:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:50:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:50:43,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:43,830 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:50:43,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINVARIANTandASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 890456194, now seen corresponding path program 1 times [2019-02-28 10:50:43,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:43,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:43,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:43,911 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:50:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:50:43,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:50:43,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:50:43,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:50:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:50:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:50:43,913 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-02-28 10:50:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:43,924 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 10:50:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:50:43,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:50:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:43,925 INFO L225 Difference]: With dead ends: 7 [2019-02-28 10:50:43,925 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:50:43,926 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:50:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:50:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:50:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:50:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:50:43,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-28 10:50:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:43,928 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:50:43,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:50:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:50:43,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:50:43,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:50:44,311 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-02-28 10:50:44,314 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:50:44,314 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-02-28 10:50:44,315 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:50:44,315 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 8 28) no Hoare annotation was computed. [2019-02-28 10:50:44,315 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 26) no Hoare annotation was computed. [2019-02-28 10:50:44,315 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:50:44,316 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINVARIANTandASSERT(line 19) no Hoare annotation was computed. [2019-02-28 10:50:44,316 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2019-02-28 10:50:44,328 INFO L202 PluginConnector]: Adding new model GeometricalIntegerCakeWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:50:44 BoogieIcfgContainer [2019-02-28 10:50:44,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:50:44,329 INFO L168 Benchmark]: Toolchain (without parser) took 3862.25 ms. Allocated memory was 134.7 MB in the beginning and 220.2 MB in the end (delta: 85.5 MB). Free memory was 105.9 MB in the beginning and 156.8 MB in the end (delta: -50.9 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:50:44,330 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:50:44,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 134.7 MB. Free memory was 105.9 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:50:44,332 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 ms. Allocated memory is still 134.7 MB. Free memory was 103.8 MB in the beginning and 102.9 MB in the end (delta: 880.8 kB). Peak memory consumption was 880.8 kB. Max. memory is 7.1 GB. [2019-02-28 10:50:44,333 INFO L168 Benchmark]: RCFGBuilder took 319.29 ms. Allocated memory is still 134.7 MB. Free memory was 102.9 MB in the beginning and 93.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:50:44,334 INFO L168 Benchmark]: TraceAbstraction took 3480.48 ms. Allocated memory was 134.7 MB in the beginning and 220.2 MB in the end (delta: 85.5 MB). Free memory was 92.9 MB in the beginning and 156.8 MB in the end (delta: -63.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:50:44,339 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.19 ms. Allocated memory is still 134.7 MB. Free memory is still 106.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 134.7 MB. Free memory was 105.9 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.99 ms. Allocated memory is still 134.7 MB. Free memory was 103.8 MB in the beginning and 102.9 MB in the end (delta: 880.8 kB). Peak memory consumption was 880.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 319.29 ms. Allocated memory is still 134.7 MB. Free memory was 102.9 MB in the beginning and 93.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3480.48 ms. Allocated memory was 134.7 MB in the beginning and 220.2 MB in the end (delta: 85.5 MB). Free memory was 92.9 MB in the beginning and 156.8 MB in the end (delta: -63.9 MB). Peak memory consumption was 21.6 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.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 10 SDslu, 1 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s 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.4s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.0s 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...