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 -i ../../../trunk/examples/programs/abstractInterpretation/unclassified/preboogie.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:56,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:56,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:56,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:56,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:56,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:56,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:56,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:56,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:56,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:56,819 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:56,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:56,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:56,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:56,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:56,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:56,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:56,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:56,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:56,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:56,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:56,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:56,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:56,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:56,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:56,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:56,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:56,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:56,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:56,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:56,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:56,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:56,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:56,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:56,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:56,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:56,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:56,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:56,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:56,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:56,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:56,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:56,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:56,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:56,921 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:56,922 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:56,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/preboogie.bpl [2019-08-05 11:14:56,923 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/preboogie.bpl' [2019-08-05 11:14:56,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:56,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:56,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:56,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:56,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:56,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:57,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:57,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:57,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:57,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:57,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:57,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:57,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:57,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:57,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:14:57,098 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:14:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:14:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:14:57,099 INFO L124 BoogieDeclarations]: Specification and implementation of procedure fibo given in one single declaration [2019-08-05 11:14:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-08-05 11:14:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-08-05 11:14:57,270 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:14:57,271 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:57,272 INFO L202 PluginConnector]: Adding new model preboogie.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:57 BoogieIcfgContainer [2019-08-05 11:14:57,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:57,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:57,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:57,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:57,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "preboogie.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/2) ... [2019-08-05 11:14:57,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b63149b and model type preboogie.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:57, skipping insertion in model container [2019-08-05 11:14:57,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "preboogie.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:57" (2/2) ... [2019-08-05 11:14:57,281 INFO L109 eAbstractionObserver]: Analyzing ICFG preboogie.bpl [2019-08-05 11:14:57,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:57,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:57,315 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:57,342 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:57,343 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:57,343 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:57,343 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:57,343 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:57,344 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:57,344 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:57,344 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:57,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-08-05 11:14:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:57,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:57,370 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash 605339513, now seen corresponding path program 1 times [2019-08-05 11:14:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:57,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:14:57,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:57,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:57,706 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 5 states. [2019-08-05 11:14:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,888 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-08-05 11:14:57,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:57,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:14:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,900 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:57,900 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:57,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:57,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 11:14:57,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2019-08-05 11:14:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,940 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 11:14:57,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 11:14:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:57,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,942 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:14:57,943 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1632136072, now seen corresponding path program 1 times [2019-08-05 11:14:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:14:58,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:58,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:58,071 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 6 states. [2019-08-05 11:14:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,424 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-08-05 11:14:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:58,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-08-05 11:14:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,427 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:14:58,427 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:14:58,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:14:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:14:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 11:14:58,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 19 [2019-08-05 11:14:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,437 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 11:14:58,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 11:14:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:14:58,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,440 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 11:14:58,440 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2002255097, now seen corresponding path program 2 times [2019-08-05 11:14:58,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 58 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-08-05 11:14:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:58,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:58,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:58,677 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2019-08-05 11:14:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,969 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2019-08-05 11:14:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:58,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-08-05 11:14:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,972 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:14:58,972 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:14:58,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:14:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:14:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:14:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2019-08-05 11:14:58,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 52 [2019-08-05 11:14:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,985 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 35 transitions. [2019-08-05 11:14:58,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 35 transitions. [2019-08-05 11:14:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:14:58,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,991 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-08-05 11:14:58,992 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2055336584, now seen corresponding path program 3 times [2019-08-05 11:14:58,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 455 proven. 57 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-08-05 11:14:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:59,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:59,320 INFO L87 Difference]: Start difference. First operand 22 states and 35 transitions. Second operand 10 states. [2019-08-05 11:15:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:00,080 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2019-08-05 11:15:00,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:15:00,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2019-08-05 11:15:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:00,084 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:15:00,084 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:15:00,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:15:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-08-05 11:15:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:15:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-08-05 11:15:00,093 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 107 [2019-08-05 11:15:00,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:00,094 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-08-05 11:15:00,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-08-05 11:15:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:15:00,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:00,097 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:15:00,097 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1029496802, now seen corresponding path program 4 times [2019-08-05 11:15:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:00,199 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:00,228 INFO L202 PluginConnector]: Adding new model preboogie.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:00 BoogieIcfgContainer [2019-08-05 11:15:00,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:00,231 INFO L168 Benchmark]: Toolchain (without parser) took 3266.15 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 112.3 MB in the beginning and 174.2 MB in the end (delta: -62.0 MB). Peak memory consumption was 95.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,233 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,235 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 ms. Allocated memory is still 134.7 MB. Free memory was 110.6 MB in the beginning and 109.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,236 INFO L168 Benchmark]: RCFGBuilder took 243.62 ms. Allocated memory is still 134.7 MB. Free memory was 109.5 MB in the beginning and 99.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,237 INFO L168 Benchmark]: TraceAbstraction took 2954.62 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 174.2 MB in the end (delta: -74.6 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:00,242 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.53 ms. Allocated memory is still 134.7 MB. Free memory was 110.6 MB in the beginning and 109.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 243.62 ms. Allocated memory is still 134.7 MB. Free memory was 109.5 MB in the beginning and 99.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2954.62 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 174.2 MB in the end (delta: -74.6 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: assertion can be violated assertion can be violated We found a FailurePath: [L24] ~x~3 := 3; VAL [~x~3=3] [L25] CALL call #t~ret2 := fibo(~x~3); VAL [#in~n=3] [L6] ~n := #in~n; VAL [#in~n=3, ~n=3] [L7] COND FALSE !(~n == 0) VAL [#in~n=3, ~n=3] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=2] [L6] ~n := #in~n; VAL [#in~n=2, ~n=2] [L7] COND FALSE !(~n == 0) VAL [#in~n=2, ~n=2] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L6] ~n := #in~n; VAL [#in~n=1, ~n=1] [L7] COND FALSE !(~n == 0) VAL [#in~n=1, ~n=1] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, ~n=1] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, #t~ret1=0, ~n=1] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=1, #res=0, ~n=1] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=0, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=1] [L6] ~n := #in~n; VAL [#in~n=1, ~n=1] [L7] COND FALSE !(~n == 0) VAL [#in~n=1, ~n=1] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, ~n=1] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, #t~ret1=0, ~n=1] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=1, #res=0, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=0, #t~ret1=0, ~n=2] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=2, #res=0, ~n=2] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=0, ~n=3] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=2] [L6] ~n := #in~n; VAL [#in~n=2, ~n=2] [L7] COND FALSE !(~n == 0) VAL [#in~n=2, ~n=2] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=1] [L6] ~n := #in~n; VAL [#in~n=1, ~n=1] [L7] COND FALSE !(~n == 0) VAL [#in~n=1, ~n=1] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, ~n=1] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, #t~ret1=0, ~n=1] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=1, #res=0, ~n=1] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=0, ~n=2] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=1] [L6] ~n := #in~n; VAL [#in~n=1, ~n=1] [L7] COND FALSE !(~n == 0) VAL [#in~n=1, ~n=1] [L9] CALL call #t~ret0 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L9] RET call #t~ret0 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, ~n=1] [L11] CALL call #t~ret1 := fibo(~n - 1); VAL [#in~n=0] [L6] ~n := #in~n; VAL [#in~n=0, ~n=0] [L7] COND TRUE ~n == 0 VAL [#in~n=0, ~n=0] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=1, #t~ret0=0, #t~ret1=0, ~n=1] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=1, #res=0, ~n=1] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=2, #t~ret0=0, #t~ret1=0, ~n=2] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=2, #res=0, ~n=2] [L11] RET call #t~ret1 := fibo(~n - 1); VAL [#in~n=3, #t~ret0=0, #t~ret1=0, ~n=3] [L13] #res := #t~ret0 + #t~ret1; [L14] havoc #t~ret0; [L15] havoc #t~ret1; VAL [#in~n=3, #res=0, ~n=3] [L25] RET call #t~ret2 := fibo(~x~3); VAL [#t~ret2=0, ~x~3=3] [L27] havoc #t~ret2; VAL [~x~3=3] [L29] assert false; VAL [~x~3=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. UNSAFE Result, 2.8s OverallTime, 5 OverallIterations, 19 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 65 SDslu, 74 SDs, 0 SdLazy, 184 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 21558 SizeOfPredicates, 15 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 845/966 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...