java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/nestedLoop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:18:12,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:18:12,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:18:12,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:18:12,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:18:12,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:18:12,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:18:12,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:18:12,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:18:12,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:18:12,303 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:18:12,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:18:12,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:18:12,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:18:12,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:18:12,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:18:12,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:18:12,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:18:12,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:18:12,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:18:12,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:18:12,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:18:12,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:18:12,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:18:12,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:18:12,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:18:12,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:18:12,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:18:12,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:18:12,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:18:12,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:18:12,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:18:12,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:18:12,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:18:12,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:18:12,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:18:12,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:18:12,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:18:12,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:18:12,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:18:12,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:18:12,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:18:12,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:18:12,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:18:12,415 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:18:12,415 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:18:12,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/nestedLoop.bpl [2019-08-05 11:18:12,416 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/nestedLoop.bpl' [2019-08-05 11:18:12,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:18:12,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:18:12,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:12,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:18:12,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:18:12,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,482 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:18:12,483 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:18:12,483 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:18:12,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:12,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:18:12,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:18:12,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:18:12,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... [2019-08-05 11:18:12,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:18:12,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:18:12,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:18:12,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:18:12,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:18:12,582 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:18:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:18:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:18:12,858 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:18:12,858 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:18:12,859 INFO L202 PluginConnector]: Adding new model nestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:12 BoogieIcfgContainer [2019-08-05 11:18:12,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:18:12,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:18:12,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:18:12,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:18:12,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:12" (1/2) ... [2019-08-05 11:18:12,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20da93cc and model type nestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:18:12, skipping insertion in model container [2019-08-05 11:18:12,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:12" (2/2) ... [2019-08-05 11:18:12,869 INFO L109 eAbstractionObserver]: Analyzing ICFG nestedLoop.bpl [2019-08-05 11:18:12,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:18:12,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:18:12,897 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:18:12,919 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:18:12,920 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:18:12,920 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:18:12,920 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:18:12,920 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:18:12,920 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:18:12,920 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:18:12,921 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:18:12,921 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:18:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:18:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:18:12,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:12,942 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:18:12,944 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:18:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:13,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:13,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:13,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:13,093 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 11:18:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,158 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:18:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:13,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:18:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,173 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:18:13,174 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:18:13,176 INFO L628 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-08-05 11:18:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:18:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:18:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:18:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:18:13,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 3 [2019-08-05 11:18:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,226 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:18:13,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:18:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:18:13,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:18:13,228 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:18:13,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:13,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:13,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:13,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:13,299 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-08-05 11:18:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,356 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:18:13,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:13,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:18:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,357 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:18:13,358 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:18:13,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08-05 11:18:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:18:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:18:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:18:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:18:13,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-08-05 11:18:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,362 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:18:13,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:18:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:18:13,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:18:13,364 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:18:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:13,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:13,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:13,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:13,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,514 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 11:18:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,616 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 11:18:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:13,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:18:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,619 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:18:13,619 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:18:13,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:18:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:18:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:18:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:18:13,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 11:18:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,623 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:18:13,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:18:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:18:13,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,625 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 11:18:13,626 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1864963430, now seen corresponding path program 2 times [2019-08-05 11:18:13,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:18:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:13,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,702 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2019-08-05 11:18:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,735 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:18:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:13,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:18:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,737 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:18:13,737 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:18:13,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:18:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:18:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:18:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:18:13,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-05 11:18:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,741 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:18:13,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:18:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:18:13,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,743 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:18:13,743 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1228252972, now seen corresponding path program 3 times [2019-08-05 11:18:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:18:13,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:13,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:13,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,841 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 4 states. [2019-08-05 11:18:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:13,882 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:18:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:13,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:18:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:13,883 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:18:13,883 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:18:13,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:18:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:18:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:18:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:18:13,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-08-05 11:18:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:13,887 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:18:13,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:18:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:18:13,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:13,888 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:18:13,888 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -578863486, now seen corresponding path program 1 times [2019-08-05 11:18:13,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:13,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:13,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:18:13,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:13,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:13,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:13,984 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2019-08-05 11:18:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:14,012 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 11:18:14,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:14,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:18:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:14,013 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:18:14,013 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:18:14,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:18:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:18:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:18:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:18:14,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-08-05 11:18:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:14,015 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:18:14,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:18:14,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:18:14,020 INFO L202 PluginConnector]: Adding new model nestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:18:14 BoogieIcfgContainer [2019-08-05 11:18:14,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:18:14,023 INFO L168 Benchmark]: Toolchain (without parser) took 1571.79 ms. Allocated memory was 140.0 MB in the beginning and 177.2 MB in the end (delta: 37.2 MB). Free memory was 107.2 MB in the beginning and 138.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:14,024 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:18:14,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 140.0 MB. Free memory was 107.2 MB in the beginning and 105.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:14,026 INFO L168 Benchmark]: Boogie Preprocessor took 22.28 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 104.2 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. [2019-08-05 11:18:14,027 INFO L168 Benchmark]: RCFGBuilder took 351.32 ms. Allocated memory is still 140.0 MB. Free memory was 104.2 MB in the beginning and 94.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:14,028 INFO L168 Benchmark]: TraceAbstraction took 1159.50 ms. Allocated memory was 140.0 MB in the beginning and 177.2 MB in the end (delta: 37.2 MB). Free memory was 94.3 MB in the beginning and 138.1 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:18:14,032 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 140.0 MB. Free memory was 107.2 MB in the beginning and 105.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.28 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 104.2 MB in the end (delta: 872.5 kB). Peak memory consumption was 872.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 351.32 ms. Allocated memory is still 140.0 MB. Free memory was 104.2 MB in the beginning and 94.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1159.50 ms. Allocated memory was 140.0 MB in the beginning and 177.2 MB in the end (delta: 37.2 MB). Free memory was 94.3 MB in the beginning and 138.1 MB in the end (delta: -43.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 2 error locations. SAFE Result, 1.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 9 SDslu, 21 SDs, 0 SdLazy, 33 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 704 SizeOfPredicates, 4 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 23/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...