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/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:49,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:49,146 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:49,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:49,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:49,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:49,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:49,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:49,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:49,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:49,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:49,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:49,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:49,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:49,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:49,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:49,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:49,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:49,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:49,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:49,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:49,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:49,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:49,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:49,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:49,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:49,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:49,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:49,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:49,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:49,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:49,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:49,193 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:49,193 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:49,194 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:49,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:49,195 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:21:49,208 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:49,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:49,209 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:49,209 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:49,209 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:49,210 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:49,210 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:49,210 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:49,210 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:49,210 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:49,211 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:49,211 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:49,211 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:49,211 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:49,211 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:49,212 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:49,212 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:49,212 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:49,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:49,213 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:49,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:49,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:49,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:49,214 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:49,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:49,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:49,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:49,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:49,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:49,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:49,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:49,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:49,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:49,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:49,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:49,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:49,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:49,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:49,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:49,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:49,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:49,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:49,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:49,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:49,280 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:49,281 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:49,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 15:21:49,282 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl' [2018-12-03 15:21:49,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:49,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:49,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:49,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:49,317 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:49,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:49,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:49,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:49,354 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:49,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... [2018-12-03 15:21:49,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:49,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:49,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:49,377 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:49,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:49,457 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:49,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:49,762 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:49,762 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:49,763 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:49 BoogieIcfgContainer [2018-12-03 15:21:49,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:49,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:49,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:49,769 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:49,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:49" (1/2) ... [2018-12-03 15:21:49,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b80e867 and model type jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:49, skipping insertion in model container [2018-12-03 15:21:49,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:49" (2/2) ... [2018-12-03 15:21:49,773 INFO L112 eAbstractionObserver]: Analyzing ICFG jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 15:21:49,784 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:49,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:49,813 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:49,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:49,851 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:49,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:49,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:49,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:49,852 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:49,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:49,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 15:21:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:49,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:49,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:21:49,877 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:49,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash 889539593, now seen corresponding path program 1 times [2018-12-03 15:21:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:49,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:49,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:49,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:50,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:50,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:21:50,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:50,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:50,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:50,150 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-12-03 15:21:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:50,285 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2018-12-03 15:21:50,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:50,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:21:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:50,297 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:21:50,297 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:21:50,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:21:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2018-12-03 15:21:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:21:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:21:50,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:21:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:50,341 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:21:50,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:21:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:50,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:50,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:21:50,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:50,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 889599175, now seen corresponding path program 1 times [2018-12-03 15:21:50,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:50,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:50,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:21:50,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:50,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:21:50,497 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-12-03 15:21:50,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:50,688 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:21:50,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:50,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:21:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:50,690 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:21:50,690 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:21:50,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:21:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:21:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-12-03 15:21:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:21:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 15:21:50,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-12-03 15:21:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:50,696 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 15:21:50,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 15:21:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:21:50,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:50,697 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:21:50,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:50,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 628634047, now seen corresponding path program 1 times [2018-12-03 15:21:50,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:50,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:50,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:50,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:50,824 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 15:21:50,826 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18] [2018-12-03 15:21:50,867 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:50,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:51,094 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 15:21:51,096 INFO L272 AbstractInterpreter]: Visited 7 different actions 20 times. Merged at 4 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:21:51,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:51,107 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 15:21:51,183 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 53.12% of their original sizes. [2018-12-03 15:21:51,183 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 15:21:51,299 INFO L418 sIntCurrentIteration]: We unified 9 AI predicates to 9 [2018-12-03 15:21:51,300 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 15:21:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:21:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2018-12-03 15:21:51,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:21:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:21:51,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:51,303 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-12-03 15:21:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:51,473 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-12-03 15:21:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:51,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-12-03 15:21:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:51,474 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:21:51,475 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:21:51,475 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:21:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:21:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:21:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:21:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:21:51,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2018-12-03 15:21:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:51,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:21:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:21:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:21:51,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:21:51,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:21:51,637 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-12-03 15:21:51,839 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:21:51,872 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:21:51,873 INFO L444 ceAbstractionStarter]: At program point L31(lines 27 32) the Hoare annotation is: (and (= (mod ULTIMATE.start_main_~y~4 4) 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= (mod ULTIMATE.start_main_~x~4 4) 0)) [2018-12-03 15:21:51,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:21:51,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:21:51,873 INFO L444 ceAbstractionStarter]: At program point L21(lines 21 28) the Hoare annotation is: (let ((.cse0 (= (mod ULTIMATE.start_main_~y~4 4) 0)) (.cse1 (= (mod ULTIMATE.start_main_~x~4 4) 0))) (or (and .cse0 (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse1) (and .cse0 .cse1 (<= 4 ULTIMATE.start_main_~x~4)))) [2018-12-03 15:21:51,874 INFO L444 ceAbstractionStarter]: At program point L43(lines 43 44) the Hoare annotation is: false [2018-12-03 15:21:51,874 INFO L444 ceAbstractionStarter]: At program point L40(lines 17 40) the Hoare annotation is: (let ((.cse0 (= (mod ULTIMATE.start_main_~y~4 4) 0)) (.cse1 (= (mod ULTIMATE.start_main_~x~4 4) 0))) (or (and (<= 4 (+ ULTIMATE.start_main_~x~4 ULTIMATE.start_main_~y~4)) .cse0 .cse1) (and .cse0 (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= ULTIMATE.start___VERIFIER_assert_~cond 1) .cse1))) [2018-12-03 15:21:51,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2018-12-03 15:21:51,874 INFO L444 ceAbstractionStarter]: At program point L35(lines 35 41) the Hoare annotation is: (and (= (mod ULTIMATE.start_main_~y~4 4) 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond| 1) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (= (mod ULTIMATE.start_main_~x~4 4) 0)) [2018-12-03 15:21:51,882 INFO L202 PluginConnector]: Adding new model jain_5.i_2.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:21:51 BoogieIcfgContainer [2018-12-03 15:21:51,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:21:51,883 INFO L168 Benchmark]: Toolchain (without parser) took 2568.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-12-03 15:21:51,885 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:21:51,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:21:51,886 INFO L168 Benchmark]: Boogie Preprocessor took 22.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:21:51,887 INFO L168 Benchmark]: RCFGBuilder took 386.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:21:51,888 INFO L168 Benchmark]: TraceAbstraction took 2117.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:21:51,894 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 386.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2117.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main_~y~4 % 4 == 0 && __VERIFIER_assert_#in~cond == 1) && main_~x~4 % 4 == 0 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((main_~y~4 % 4 == 0 && __VERIFIER_assert_#in~cond == 1) && __VERIFIER_assert_~cond == 1) && main_~x~4 % 4 == 0) || ((main_~y~4 % 4 == 0 && main_~x~4 % 4 == 0) && 4 <= main_~x~4) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((4 <= main_~x~4 + main_~y~4 && main_~y~4 % 4 == 0) && main_~x~4 % 4 == 0) || (((main_~y~4 % 4 == 0 && __VERIFIER_assert_#in~cond == 1) && __VERIFIER_assert_~cond == 1) && main_~x~4 % 4 == 0) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((main_~y~4 % 4 == 0 && __VERIFIER_assert_#in~cond == 1) && __VERIFIER_assert_~cond == 1) && main_~x~4 % 4 == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 23 SDslu, 20 SDs, 0 SdLazy, 19 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8888888888888888 AbsIntWeakeningRatio, 0.4444444444444444 AbsIntAvgWeakeningVarsNumRemoved, 0.4444444444444444 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 12 NumberOfFragments, 98 HoareAnnotationTreeSize, 5 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...