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/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:08:41,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:08:41,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:08:41,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:08:41,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:08:41,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:08:41,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:08:41,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:08:41,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:08:41,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:08:41,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:08:41,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:08:41,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:08:41,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:08:41,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:08:41,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:08:41,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:08:41,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:08:41,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:08:41,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:08:41,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:08:41,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:08:41,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:08:41,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:08:41,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:08:41,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:08:41,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:08:41,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:08:41,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:08:41,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:08:41,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:08:41,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:08:41,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:08:41,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:08:41,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:08:41,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:08:41,422 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:08:41,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:08:41,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:08:41,446 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:08:41,446 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:08:41,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:08:41,447 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:08:41,447 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:08:41,447 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:08:41,447 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:08:41,448 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:08:41,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:08:41,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:08:41,450 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:08:41,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:08:41,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:08:41,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:08:41,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:08:41,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:08:41,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:08:41,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:08:41,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:08:41,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:08:41,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:08:41,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:08:41,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:08:41,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:08:41,453 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:08:41,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:08:41,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:08:41,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:08:41,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:08:41,454 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:08:41,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:08:41,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:08:41,454 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:08:41,454 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:08:41,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:08:41,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:08:41,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:08:41,506 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:08:41,507 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:08:41,508 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:08:41,509 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 15:08:41,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:08:41,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:08:41,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:08:41,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:08:41,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:08:41,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:08:41,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:08:41,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:08:41,583 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:08:41,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/1) ... [2018-12-03 15:08:41,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:08:41,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:08:41,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:08:41,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:08:41,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (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:08:41,682 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:08:41,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:08:41,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:08:41,914 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:08:41,914 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:08:41,915 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:08:41 BoogieIcfgContainer [2018-12-03 15:08:41,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:08:41,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:08:41,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:08:41,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:08:41,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:08:41" (1/2) ... [2018-12-03 15:08:41,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e1e053 and model type count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:08:41, skipping insertion in model container [2018-12-03 15:08:41,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:08:41" (2/2) ... [2018-12-03 15:08:41,923 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 15:08:41,934 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:08:41,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:08:41,960 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:08:41,996 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:08:41,997 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:08:41,997 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:08:41,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:08:41,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:08:41,998 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:08:41,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:08:41,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:08:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 15:08:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:08:42,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:42,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:08:42,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:42,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash 889539593, now seen corresponding path program 1 times [2018-12-03 15:08:42,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:42,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:42,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,306 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:08:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:08:42,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:42,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:08:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:08:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:08:42,358 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-12-03 15:08:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:42,557 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 15:08:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:08:42,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:08:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:42,570 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:08:42,571 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:08:42,574 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:08:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:08:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:08:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:08:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:08:42,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:08:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:42,608 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:08:42,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:08:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:08:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:08:42,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:42,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:08:42,609 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:42,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 889599175, now seen corresponding path program 1 times [2018-12-03 15:08:42,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,639 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:08:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:08:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:08:42,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:08:42,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:08:42,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:08:42,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:08:42,644 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-12-03 15:08:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:42,692 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-03 15:08:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:08:42,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-03 15:08:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:42,694 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:08:42,695 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:08:42,696 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 [2018-12-03 15:08:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:08:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 15:08:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:08:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 15:08:42,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-12-03 15:08:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:42,701 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 15:08:42,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:08:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 15:08:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:08:42,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:42,702 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:08:42,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:42,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1438040255, now seen corresponding path program 1 times [2018-12-03 15:08:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:42,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,760 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:08:42,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:42,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:42,762 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 15:08:42,764 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18] [2018-12-03 15:08:42,805 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:08:42,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:08:43,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:08:43,066 INFO L272 AbstractInterpreter]: Visited 8 different actions 33 times. Merged at 7 different actions 18 times. Widened at 1 different actions 1 times. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:08:43,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:43,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:08:43,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:43,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:43,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:43,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:43,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:43,193 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:08:43,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:43,268 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:08:43,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:43,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:08:43,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:43,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:08:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:08:43,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:43,290 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-12-03 15:08:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:43,388 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 15:08:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:08:43,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 15:08:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:43,391 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:08:43,391 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:08:43,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:08:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:08:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-03 15:08:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:08:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:08:43,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-12-03 15:08:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:43,401 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:08:43,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:08:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:08:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:08:43,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:43,403 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-03 15:08:43,404 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:43,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1389400247, now seen corresponding path program 2 times [2018-12-03 15:08:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:43,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:43,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:43,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:43,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:43,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:43,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:08:43,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:43,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:43,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:08:43,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:43,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:43,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:08:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:08:43,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:43,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:08:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:08:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:43,785 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-12-03 15:08:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:43,824 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-12-03 15:08:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:08:43,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 15:08:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:43,825 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:08:43,825 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:08:43,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:08:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:08:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:08:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:08:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:08:43,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-12-03 15:08:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:43,828 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:08:43,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:08:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:08:43,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:08:43,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:08:43,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:08:43,986 INFO L444 ceAbstractionStarter]: At program point L32(lines 32 41) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= ULTIMATE.start_main_~i~4 999999) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) [2018-12-03 15:08:43,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:08:43,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2018-12-03 15:08:43,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 46) no Hoare annotation was computed. [2018-12-03 15:08:43,986 INFO L444 ceAbstractionStarter]: At program point L28(lines 24 29) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 999999) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)) [2018-12-03 15:08:43,987 INFO L444 ceAbstractionStarter]: At program point L18(lines 18 25) the Hoare annotation is: (<= ULTIMATE.start_main_~i~4 999999) [2018-12-03 15:08:43,987 INFO L444 ceAbstractionStarter]: At program point L43(lines 43 44) the Hoare annotation is: false [2018-12-03 15:08:43,987 INFO L444 ceAbstractionStarter]: At program point L40(lines 15 40) the Hoare annotation is: (<= ULTIMATE.start_main_~i~4 1000000) [2018-12-03 15:08:43,998 INFO L202 PluginConnector]: Adding new model count_by_1_variant.i_2.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:08:43 BoogieIcfgContainer [2018-12-03 15:08:43,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:08:43,999 INFO L168 Benchmark]: Toolchain (without parser) took 2455.42 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: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:44,001 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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:08:44,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.96 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:08:44,002 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 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:08:44,003 INFO L168 Benchmark]: RCFGBuilder took 311.02 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:44,004 INFO L168 Benchmark]: TraceAbstraction took 2082.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2018-12-03 15:08:44,008 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.20 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.96 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 21.52 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 311.02 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2082.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 87.2 MB). Peak memory consumption was 87.2 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: 32]: Loop Invariant Derived loop invariant: (1 <= __VERIFIER_assert_~cond && main_~i~4 <= 999999) && 1 <= __VERIFIER_assert_#in~cond - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main_~i~4 <= 999999 && 1 <= __VERIFIER_assert_#in~cond - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: main_~i~4 <= 999999 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: main_~i~4 <= 1000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 18 SDslu, 19 SDs, 0 SdLazy, 33 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 15 NumberOfFragments, 24 HoareAnnotationTreeSize, 5 FomulaSimplifications, 168 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 1593 SizeOfPredicates, 1 NumberOfNonLiveVariables, 53 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 39/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...