java -ea -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/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:07:28,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:07:28,829 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:07:28,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:07:28,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:07:28,843 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:07:28,849 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:07:28,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:07:28,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:07:28,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:07:28,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:07:28,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:07:28,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:07:28,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:07:28,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:07:28,871 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:07:28,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:07:28,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:07:28,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:07:28,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:07:28,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:07:28,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:07:28,883 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:07:28,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:07:28,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:07:28,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:07:28,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:07:28,887 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:07:28,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:07:28,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:07:28,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:07:28,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:07:28,891 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:07:28,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:07:28,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:07:28,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:07:28,893 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-01-31 15:07:28,913 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:07:28,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:07:28,916 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:07:28,916 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:07:28,916 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:07:28,916 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:07:28,919 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:07:28,919 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:07:28,919 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:07:28,920 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:07:28,920 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:07:28,920 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:07:28,920 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:07:28,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:07:28,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:07:28,921 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:07:28,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:07:28,923 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:07:28,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:07:28,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:07:28,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:07:28,924 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:07:28,924 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:07:28,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:07:28,924 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:07:28,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:07:28,925 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:07:28,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:07:28,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:07:28,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:07:28,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:07:28,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:07:28,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:07:28,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:07:28,927 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:07:28,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:07:28,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:07:28,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:07:28,928 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:07:28,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:07:28,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:07:28,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:07:28,996 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:07:28,997 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:07:28,997 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2019-01-31 15:07:28,998 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2019-01-31 15:07:29,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:07:29,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:07:29,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:07:29,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:07:29,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:07:29,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,081 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 15:07:29,082 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 15:07:29,082 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 15:07:29,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:07:29,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:07:29,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:07:29,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:07:29,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... [2019-01-31 15:07:29,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:07:29,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:07:29,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:07:29,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:07:29,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:07:29,190 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-31 15:07:29,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-31 15:07:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-31 15:07:29,472 INFO L278 CfgBuilder]: Using library mode [2019-01-31 15:07:29,473 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 15:07:29,474 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:07:29 BoogieIcfgContainer [2019-01-31 15:07:29,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:07:29,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:07:29,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:07:29,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:07:29,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:07:29" (1/2) ... [2019-01-31 15:07:29,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5033f2df and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:07:29, skipping insertion in model container [2019-01-31 15:07:29,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:07:29" (2/2) ... [2019-01-31 15:07:29,482 INFO L112 eAbstractionObserver]: Analyzing ICFG CountTillBound-Jupiter.bpl [2019-01-31 15:07:29,492 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:07:29,500 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 15:07:29,520 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 15:07:29,597 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:07:29,597 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:07:29,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:07:29,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:07:29,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:07:29,606 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:07:29,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:07:29,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:07:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 15:07:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:07:29,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:07:29,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:07:29,652 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:07:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-01-31 15:07:29,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:07:29,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:29,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:07:29,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:29,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:07:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:07:29,860 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} x := 0;y := 42; {12#(<= main_x 0)} is VALID [2019-01-31 15:07:29,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= main_x 0)} assume !(x < 100); {11#false} is VALID [2019-01-31 15:07:29,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(x == 100 && y == 42); {11#false} is VALID [2019-01-31 15:07:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:07:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:07:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 15:07:29,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:07:29,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:07:29,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:07:29,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:07:29,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:29,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:07:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:07:29,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:07:29,915 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 15:07:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:30,033 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-31 15:07:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:07:30,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:07:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:07:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:07:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-31 15:07:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:07:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-31 15:07:30,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2019-01-31 15:07:30,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:30,127 INFO L225 Difference]: With dead ends: 12 [2019-01-31 15:07:30,127 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 15:07:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:07:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 15:07:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 15:07:30,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:07:30,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-31 15:07:30,161 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 15:07:30,161 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 15:07:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:30,163 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-31 15:07:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 15:07:30,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:30,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:30,164 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-31 15:07:30,165 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-31 15:07:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:30,166 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-31 15:07:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 15:07:30,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:30,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:30,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:07:30,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:07:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:07:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-31 15:07:30,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-01-31 15:07:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:07:30,171 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-31 15:07:30,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:07:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-31 15:07:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:07:30,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:07:30,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:07:30,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:07:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-01-31 15:07:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:07:30,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:30,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:07:30,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:07:30,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:07:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:07:30,298 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} x := 0;y := 42; {53#(<= main_x 0)} is VALID [2019-01-31 15:07:30,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#(<= main_x 0)} assume x < 100;x := x + 1; {54#(<= main_x 1)} is VALID [2019-01-31 15:07:30,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#(<= main_x 1)} assume !(y <= 0); {54#(<= main_x 1)} is VALID [2019-01-31 15:07:30,309 INFO L273 TraceCheckUtils]: 3: Hoare triple {54#(<= main_x 1)} assume !(x < 100); {52#false} is VALID [2019-01-31 15:07:30,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {52#false} assume !(x == 100 && y == 42); {52#false} is VALID [2019-01-31 15:07:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:07:30,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:07:30,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:07:30,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:07:30,314 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [13] [2019-01-31 15:07:30,389 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:07:30,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:07:31,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 15:07:31,546 INFO L272 AbstractInterpreter]: Visited 5 different actions 46 times. Merged at 2 different actions 27 times. Widened at 2 different actions 19 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 15:07:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:07:31,552 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 15:07:31,702 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-01-31 15:07:31,721 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 15:07:31,871 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 15:07:31,974 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 15:07:31,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 15:07:31,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 15:07:31,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:07:31,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 15:07:31,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:07:31,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 15:07:32,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:32,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 15:07:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 15:07:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 15:07:32,010 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 5 states. [2019-01-31 15:07:32,057 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:32,058 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:32,060 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:32,061 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,062 WARN L224 ngHoareTripleChecker]: Pre: {103#(and (<= (- (- c_main_x) c_main_x) 0) (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 42) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84) (<= (- (- c_main_x) c_main_y) (- 42)))} [2019-01-31 15:07:32,062 WARN L228 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:32,063 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:32,063 WARN L230 ngHoareTripleChecker]: Post: {104#false} [2019-01-31 15:07:32,063 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:32,064 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,064 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:32,163 WARN L270 ngHoareTripleChecker]: Pre: {103#(and (<= (- (- main_y) main_y) (- 84)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84) (<= (- (- main_x) main_y) (- 42)))} [2019-01-31 15:07:32,163 WARN L274 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:32,164 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:32,166 WARN L276 ngHoareTripleChecker]: Post: {104#false} [2019-01-31 15:07:32,167 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,167 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:32,168 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [0; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,168 WARN L628 ntHoareTripleChecker]: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) (assume x < 100;x := x + 1;) [2019-01-31 15:07:32,169 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:32,169 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,189 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:32,190 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:32,190 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:32,191 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,191 WARN L224 ngHoareTripleChecker]: Pre: {107#(and (<= (- (- c_main_x) c_main_x) 0) (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 42) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84) (<= (- (- c_main_x) c_main_y) (- 42)))} [2019-01-31 15:07:32,191 WARN L228 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:32,191 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:32,192 WARN L230 ngHoareTripleChecker]: Post: {108#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) c_main_x) (- 200)) (<= (- (- c_main_x) c_main_y) (- 142)) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- (- c_main_x) (- c_main_y)) (- 58)) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:32,192 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:32,196 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,196 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:32,263 WARN L270 ngHoareTripleChecker]: Pre: {107#(and (<= (- (- main_y) main_y) (- 84)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84) (<= (- (- main_x) main_y) (- 42)))} [2019-01-31 15:07:32,263 WARN L274 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:32,264 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:32,285 WARN L276 ngHoareTripleChecker]: Post: {108#(and (<= (- (- main_x) main_y) (- 142)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:32,286 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,286 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:32,286 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [0; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,287 WARN L628 ntHoareTripleChecker]: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) (assume x < 100;x := x + 1;) [2019-01-31 15:07:32,287 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [100; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,287 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,434 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:32,434 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:32,435 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:32,435 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,436 WARN L224 ngHoareTripleChecker]: Pre: {115#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 41) (<= (- (- c_main_x) c_main_x) (- 2)) (<= (- c_main_x (- c_main_y)) 142) (<= (- (- c_main_x) c_main_y) (- 43)) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:32,436 WARN L228 ngHoareTripleChecker]: Action: assume !(y <= 0); [2019-01-31 15:07:32,436 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_main_y 0)) [2019-01-31 15:07:32,437 WARN L230 ngHoareTripleChecker]: Post: {116#false} [2019-01-31 15:07:32,437 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:32,438 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,438 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:32,634 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 15:07:32,635 WARN L270 ngHoareTripleChecker]: Pre: {115#(and (<= (- (- main_y) main_y) (- 84)) (<= (- (- main_x) main_y) (- 43)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:32,635 WARN L274 ngHoareTripleChecker]: Action: assume !(y <= 0); [2019-01-31 15:07:32,635 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_main_y 0)) [2019-01-31 15:07:32,675 WARN L276 ngHoareTripleChecker]: Post: {116#false} [2019-01-31 15:07:32,676 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,676 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:32,676 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [1; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,677 WARN L628 ntHoareTripleChecker]: (not (<= c_main_y 0)) (assume !(y <= 0);) [2019-01-31 15:07:32,677 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:32,677 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,744 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:32,745 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:32,746 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:32,746 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,747 WARN L224 ngHoareTripleChecker]: Pre: {117#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 41) (<= (- (- c_main_x) c_main_x) (- 2)) (<= (- c_main_x (- c_main_y)) 142) (<= (- (- c_main_x) c_main_y) (- 43)) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:32,747 WARN L228 ngHoareTripleChecker]: Action: assume !(y <= 0); [2019-01-31 15:07:32,748 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_main_y 0)) [2019-01-31 15:07:32,748 WARN L230 ngHoareTripleChecker]: Post: {118#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) c_main_x) (- 200)) (<= (- (- c_main_x) c_main_y) (- 142)) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- (- c_main_x) (- c_main_y)) (- 58)) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:32,748 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:32,749 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,749 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:32,908 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 15:07:32,908 WARN L270 ngHoareTripleChecker]: Pre: {117#(and (<= (- (- main_y) main_y) (- 84)) (<= (- (- main_x) main_y) (- 43)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:32,909 WARN L274 ngHoareTripleChecker]: Action: assume !(y <= 0); [2019-01-31 15:07:32,909 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= c_main_y 0)) [2019-01-31 15:07:32,932 WARN L276 ngHoareTripleChecker]: Post: {118#(and (<= (- (- main_x) main_y) (- 142)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:32,933 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,933 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:32,933 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [1; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,934 WARN L628 ntHoareTripleChecker]: (not (<= c_main_y 0)) (assume !(y <= 0);) [2019-01-31 15:07:32,934 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [100; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:32,935 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:32,973 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:32,973 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:32,974 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:32,974 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,974 WARN L224 ngHoareTripleChecker]: Pre: {123#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 41) (<= (- (- c_main_x) c_main_x) (- 2)) (<= (- c_main_x (- c_main_y)) 142) (<= (- (- c_main_x) c_main_y) (- 43)) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:32,974 WARN L228 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:32,974 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:32,975 WARN L230 ngHoareTripleChecker]: Post: {124#false} [2019-01-31 15:07:32,975 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:32,976 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:32,976 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:33,027 WARN L270 ngHoareTripleChecker]: Pre: {123#(and (<= (- (- main_y) main_y) (- 84)) (<= (- (- main_x) main_y) (- 43)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:33,028 WARN L274 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:33,028 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:33,030 WARN L276 ngHoareTripleChecker]: Post: {124#false} [2019-01-31 15:07:33,030 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,039 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:33,040 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [1; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:33,040 WARN L628 ntHoareTripleChecker]: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) (assume x < 100;x := x + 1;) [2019-01-31 15:07:33,040 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:33,040 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,071 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:33,071 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:33,071 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:33,072 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:33,072 WARN L224 ngHoareTripleChecker]: Pre: {125#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 41) (<= (- (- c_main_x) c_main_x) (- 2)) (<= (- c_main_x (- c_main_y)) 142) (<= (- (- c_main_x) c_main_y) (- 43)) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:33,072 WARN L228 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:33,072 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:33,072 WARN L230 ngHoareTripleChecker]: Post: {126#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) c_main_x) (- 200)) (<= (- (- c_main_x) c_main_y) (- 142)) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- (- c_main_x) (- c_main_y)) (- 58)) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:33,072 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:33,073 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:33,073 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:33,095 WARN L270 ngHoareTripleChecker]: Pre: {125#(and (<= (- (- main_y) main_y) (- 84)) (<= (- (- main_x) main_y) (- 43)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:33,096 WARN L274 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2019-01-31 15:07:33,096 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2019-01-31 15:07:33,116 WARN L276 ngHoareTripleChecker]: Post: {126#(and (<= (- (- main_x) main_y) (- 142)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:33,116 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,117 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:33,117 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [1; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:33,118 WARN L628 ntHoareTripleChecker]: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) (assume x < 100;x := x + 1;) [2019-01-31 15:07:33,118 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [100; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:33,118 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,147 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:07:33,147 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:07:33,148 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:07:33,148 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:07:33,148 WARN L224 ngHoareTripleChecker]: Pre: {127#(and (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 41) (<= (- (- c_main_x) c_main_x) (- 2)) (<= (- c_main_x (- c_main_y)) 142) (<= (- (- c_main_x) c_main_y) (- 43)) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84))} [2019-01-31 15:07:33,148 WARN L228 ngHoareTripleChecker]: Action: assume !(x < 100); [2019-01-31 15:07:33,149 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (< c_main_x 100)) [2019-01-31 15:07:33,149 WARN L230 ngHoareTripleChecker]: Post: {128#false} [2019-01-31 15:07:33,149 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:07:33,150 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:07:33,150 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:07:33,220 WARN L270 ngHoareTripleChecker]: Pre: {127#(and (<= (- (- main_y) main_y) (- 84)) (<= (- (- main_x) main_y) (- 43)) (<= (- main_x main_y) 58) (<= (- main_y (- main_y)) 84))} [2019-01-31 15:07:33,221 WARN L274 ngHoareTripleChecker]: Action: assume !(x < 100); [2019-01-31 15:07:33,221 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (< c_main_x 100)) [2019-01-31 15:07:33,223 WARN L276 ngHoareTripleChecker]: Post: {128#false} [2019-01-31 15:07:33,223 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,223 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:07:33,223 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [1; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2019-01-31 15:07:33,224 WARN L628 ntHoareTripleChecker]: (not (< c_main_x 100)) (assume !(x < 100);) [2019-01-31 15:07:33,224 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:07:33,224 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:07:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:33,235 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 15:07:33,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 15:07:33,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-31 15:07:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:07:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 15:07:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-31 15:07:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 15:07:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-01-31 15:07:33,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2019-01-31 15:07:33,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:07:33,346 INFO L225 Difference]: With dead ends: 9 [2019-01-31 15:07:33,346 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 15:07:33,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 15:07:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 15:07:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 15:07:33,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:07:33,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:33,349 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:33,349 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:33,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:07:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:33,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:33,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:33,351 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:33,351 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:07:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:07:33,351 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:07:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:33,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:33,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:07:33,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:07:33,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:07:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 15:07:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 15:07:33,352 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-01-31 15:07:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:07:33,352 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 15:07:33,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 15:07:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:07:33,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:07:33,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 15:07:33,623 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 14 28) no Hoare annotation was computed. [2019-01-31 15:07:33,623 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-31 15:07:33,623 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 28) no Hoare annotation was computed. [2019-01-31 15:07:33,623 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (let ((.cse0 (* 2 main_y))) (and (<= .cse0 84) (<= 84 .cse0) (<= 2 (* 2 main_x)) (<= (+ main_x main_y) 142))) [2019-01-31 15:07:33,624 INFO L444 ceAbstractionStarter]: At program point L19-1(lines 19 25) the Hoare annotation is: (let ((.cse1 (+ main_x main_y))) (or (let ((.cse0 (* 2 main_y))) (and (<= .cse0 84) (<= 84 .cse0) (<= 2 (* 2 main_x)) (<= .cse1 142))) (and (<= main_y (+ main_x 42)) (<= main_x 0) (<= 42 .cse1)))) [2019-01-31 15:07:33,624 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 28) no Hoare annotation was computed. [2019-01-31 15:07:33,624 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 27) no Hoare annotation was computed. [2019-01-31 15:07:33,625 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-31 15:07:33,627 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 15:07:33,636 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 15:07:33,636 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2019-01-31 15:07:33,636 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-31 15:07:33,636 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 15:07:33,642 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 03:07:33 BoogieIcfgContainer [2019-01-31 15:07:33,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 15:07:33,644 INFO L168 Benchmark]: Toolchain (without parser) took 4602.53 ms. Allocated memory was 138.4 MB in the beginning and 261.1 MB in the end (delta: 122.7 MB). Free memory was 106.1 MB in the beginning and 230.3 MB in the end (delta: -124.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:33,645 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:33,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 138.4 MB. Free memory was 106.1 MB in the beginning and 104.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:33,647 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 ms. Allocated memory is still 138.4 MB. Free memory was 104.1 MB in the beginning and 102.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:33,648 INFO L168 Benchmark]: RCFGBuilder took 363.84 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-31 15:07:33,649 INFO L168 Benchmark]: TraceAbstraction took 4167.18 ms. Allocated memory was 138.4 MB in the beginning and 261.1 MB in the end (delta: 122.7 MB). Free memory was 92.8 MB in the beginning and 230.3 MB in the end (delta: -137.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:07:33,655 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 138.4 MB. Free memory was 106.1 MB in the beginning and 104.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.97 ms. Allocated memory is still 138.4 MB. Free memory was 104.1 MB in the beginning and 102.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.84 ms. Allocated memory is still 138.4 MB. Free memory was 102.9 MB in the beginning and 93.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4167.18 ms. Allocated memory was 138.4 MB in the beginning and 261.1 MB in the end (delta: 122.7 MB). Free memory was 92.8 MB in the beginning and 230.3 MB in the end (delta: -137.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 19]: Loop Invariant Derived loop invariant: (((2 * y <= 84 && 84 <= 2 * y) && 2 <= 2 * x) && x + y <= 142) || ((y <= x + 42 && x <= 0) && 42 <= x + y) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((2 * y <= 84 && 84 <= 2 * y) && 2 <= 2 * x) && x + y <= 142 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 4 SDslu, 3 SDs, 0 SdLazy, 6 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 57 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...