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_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:21,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:21,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:21,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:21,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:21,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:21,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:21,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:21,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:21,087 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:21,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:21,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:21,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:21,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:21,099 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:21,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:21,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:21,108 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:21,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:21,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:21,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:21,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:21,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:21,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:21,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:21,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:21,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:21,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:21,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:21,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:21,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:21,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:21,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:21,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:21,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:21,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:21,147 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:21,169 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:21,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:21,171 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:21,172 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:21,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:21,172 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:21,172 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:21,173 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:21,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:21,173 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:21,174 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:21,174 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:21,174 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:21,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:21,175 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:21,175 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:21,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:21,178 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:21,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:21,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:21,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:21,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:21,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:21,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:21,180 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:21,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:21,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:21,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:21,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:21,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:21,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:21,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:21,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:21,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:21,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:21,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:21,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:21,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:21,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:21,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:21,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:21,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:21,255 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:21,256 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:21,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2019-03-04 16:38:21,258 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-03-04 16:38:21,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:21,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:21,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:21,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:21,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:21,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:21,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:21,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:21,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:21,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (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 [2019-03-04 16:38:21,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:21,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:21,775 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-03-04 16:38:21,777 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:21,777 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-03-04 16:38:21,780 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21 BoogieIcfgContainer [2019-03-04 16:38:21,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:21,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:21,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:21,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:21,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/2) ... [2019-03-04 16:38:21,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306e3c73 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:21, skipping insertion in model container [2019-03-04 16:38:21,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21" (2/2) ... [2019-03-04 16:38:21,800 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2019-03-04 16:38:21,829 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:21,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:21,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:21,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:21,959 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:21,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:21,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:21,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:21,960 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:21,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:21,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:38:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:21,981 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:21,994 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-03-04 16:38:22,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:22,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:38:22,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:22,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:22,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:22,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:22,273 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:38:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:22,363 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-03-04 16:38:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:22,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-03-04 16:38:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:22,381 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:38:22,381 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:38:22,385 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-03-04 16:38:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:38:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-03-04 16:38:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:38:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-03-04 16:38:22,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-03-04 16:38:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-03-04 16:38:22,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-03-04 16:38:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:22,421 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:22,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:38:22,421 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2019-03-04 16:38:22,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:22,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,554 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:38:22,556 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [23] [2019-03-04 16:38:22,630 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:22,698 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-03-04 16:38:23,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:23,263 INFO L272 AbstractInterpreter]: Visited 6 different actions 117 times. Merged at 2 different actions 74 times. Widened at 1 different actions 35 times. Found 38 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:23,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:23,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:23,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:23,614 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:38:23,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [3] total 7 [2019-03-04 16:38:23,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:23,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:38:23,617 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-03-04 16:38:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,859 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2019-03-04 16:38:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:23,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-03-04 16:38:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,861 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:38:23,861 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:38:23,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:38:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 10. [2019-03-04 16:38:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:38:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-03-04 16:38:23,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-03-04 16:38:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,867 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-03-04 16:38:23,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-03-04 16:38:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:23,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:38:23,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash -375296184, now seen corresponding path program 1 times [2019-03-04 16:38:23,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:24,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:38:24,043 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [21], [23], [29], [31] [2019-03-04 16:38:24,045 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:24,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:24,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-03-04 16:38:26,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:26,248 INFO L272 AbstractInterpreter]: Visited 9 different actions 752 times. Merged at 7 different actions 555 times. Widened at 5 different actions 396 times. Found 191 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:38:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:26,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:26,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-03-04 16:38:26,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:26,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:26,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:26,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:26,879 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2019-03-04 16:38:26,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,908 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,909 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2019-03-04 16:38:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:38:27,107 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:38:27,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [3] total 8 [2019-03-04 16:38:27,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:27,110 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2019-03-04 16:38:27,318 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-03-04 16:38:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:27,383 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2019-03-04 16:38:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:27,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-03-04 16:38:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:27,385 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:38:27,398 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:38:27,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:38:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:38:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:38:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:38:27,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-03-04 16:38:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:27,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:38:27,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:38:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:38:27,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:38:27,622 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-03-04 16:38:27,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2019-03-04 16:38:27,642 INFO L451 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: true [2019-03-04 16:38:27,642 INFO L444 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2019-03-04 16:38:27,642 INFO L451 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2019-03-04 16:38:27,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 124) no Hoare annotation was computed. [2019-03-04 16:38:27,642 INFO L444 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2019-03-04 16:38:27,642 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2019-03-04 16:38:27,642 INFO L444 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= (select ULTIMATE.start_main_~string_entrada~5 0) 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0)) [2019-03-04 16:38:27,649 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:38:27 BoogieIcfgContainer [2019-03-04 16:38:27,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:38:27,650 INFO L168 Benchmark]: Toolchain (without parser) took 6326.99 ms. Allocated memory was 138.4 MB in the beginning and 347.1 MB in the end (delta: 208.7 MB). Free memory was 104.6 MB in the beginning and 316.7 MB in the end (delta: -212.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:27,651 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:27,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.54 ms. Allocated memory is still 138.4 MB. Free memory was 104.6 MB in the beginning and 102.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:27,652 INFO L168 Benchmark]: Boogie Preprocessor took 32.29 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 101.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:27,653 INFO L168 Benchmark]: RCFGBuilder took 377.91 ms. Allocated memory is still 138.4 MB. Free memory was 101.6 MB in the beginning and 90.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:38:27,654 INFO L168 Benchmark]: TraceAbstraction took 5862.86 ms. Allocated memory was 138.4 MB in the beginning and 347.1 MB in the end (delta: 208.7 MB). Free memory was 90.2 MB in the beginning and 316.7 MB in the end (delta: -226.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:38:27,659 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.28 ms. Allocated memory is still 138.4 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.54 ms. Allocated memory is still 138.4 MB. Free memory was 104.6 MB in the beginning and 102.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.29 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 101.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.91 ms. Allocated memory is still 138.4 MB. Free memory was 101.6 MB in the beginning and 90.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5862.86 ms. Allocated memory was 138.4 MB in the beginning and 347.1 MB in the end (delta: 208.7 MB). Free memory was 90.2 MB in the beginning and 316.7 MB in the end (delta: -226.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: 102]: 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: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~string_entrada~5[0] == 0) && main_~cont_aux~5 == 0) && main_~i~5 == 0 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 17 SDslu, 13 SDs, 0 SdLazy, 31 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 19 HoareAnnotationTreeSize, 5 FomulaSimplifications, 42 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 745 SizeOfPredicates, 11 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 10/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...