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/abstractInterpretation/regression/oct/loop-nested.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:21,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:21,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:21,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:21,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:21,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:21,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:21,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:21,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:21,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:21,796 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:21,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:21,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:21,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:21,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:21,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:21,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:21,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:21,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:21,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:21,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:21,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:21,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:21,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:21,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:21,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:21,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:21,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:21,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:21,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:21,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:21,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:21,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:21,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:21,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:21,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:21,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:21,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:21,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:21,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:21,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:21,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:21,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:21,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:21,881 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:21,882 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:21,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/oct/loop-nested.bpl [2019-08-05 11:09:21,883 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/oct/loop-nested.bpl' [2019-08-05 11:09:21,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:21,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:21,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:21,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:21,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:21,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,942 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:09:21,942 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:09:21,942 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:09:21,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:21,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:21,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:21,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:21,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/1) ... [2019-08-05 11:09:21,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:21,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:21,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:21,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:21,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09: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: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:09:22,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure EasyLoop given in one single declaration [2019-08-05 11:09:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure EasyLoop [2019-08-05 11:09:22,037 INFO L138 BoogieDeclarations]: Found implementation of procedure EasyLoop [2019-08-05 11:09:22,291 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:09:22,292 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:22,293 INFO L202 PluginConnector]: Adding new model loop-nested.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:22 BoogieIcfgContainer [2019-08-05 11:09:22,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:22,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:22,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:22,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:22,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:21" (1/2) ... [2019-08-05 11:09:22,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551f0d6c and model type loop-nested.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:22, skipping insertion in model container [2019-08-05 11:09:22,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:22" (2/2) ... [2019-08-05 11:09:22,301 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-nested.bpl [2019-08-05 11:09:22,310 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:22,317 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:22,332 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:22,355 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:22,356 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:22,356 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:22,356 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:22,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:22,356 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:22,357 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:22,357 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:22,357 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:09:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:09:22,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:22,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:09:22,382 INFO L418 AbstractCegarLoop]: === Iteration 1 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:09:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:22,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:09:22,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:22,524 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:09:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:22,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:09:22,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:22,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:22,547 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:09:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:22,643 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:09:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:22,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:09:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:22,666 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:09:22,667 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:09:22,669 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:09:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:09:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:09:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:09:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:09:22,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:09:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:22,732 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:09:22,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:09:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:09:22,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:22,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:09:22,734 INFO L418 AbstractCegarLoop]: === Iteration 2 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:22,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:09:22,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:22,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:22,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:22,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:22,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:09:22,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:09:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:09:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:09:22,836 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:09:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:22,904 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:09:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:09:22,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:09:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:22,907 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:09:22,907 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:09:22,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:09:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:09:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:09:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:09:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:09:22,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:09:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:22,912 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:09:22,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:09:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:09:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:09:22,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:22,913 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:09:22,914 INFO L418 AbstractCegarLoop]: === Iteration 3 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:09:22,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:22,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:09:22,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:23,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:23,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:09:23,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:23,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:23,024 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:09:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:23,160 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:09:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:23,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:09:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:23,162 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:09:23,162 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:09:23,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:09:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-08-05 11:09:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:09:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:09:23,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2019-08-05 11:09:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:23,166 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:09:23,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:09:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:09:23,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:23,167 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:09:23,167 INFO L418 AbstractCegarLoop]: === Iteration 4 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1866691308, now seen corresponding path program 2 times [2019-08-05 11:09:23,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:23,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:23,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:23,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:23,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:09:23,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:23,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:23,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:23,348 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:09:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:23,422 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:09:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:23,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:09:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:23,424 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:09:23,424 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:09:23,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:09:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-08-05 11:09:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:09:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 11:09:23,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2019-08-05 11:09:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:23,428 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 11:09:23,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 11:09:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:09:23,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:23,429 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:09:23,429 INFO L418 AbstractCegarLoop]: === Iteration 5 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1980957838, now seen corresponding path program 2 times [2019-08-05 11:09:23,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:23,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:09:23,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:23,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:23,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:23,578 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 6 states. [2019-08-05 11:09:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:23,735 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:09:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:09:23,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:09:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:23,736 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:09:23,736 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:09:23,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:09:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-08-05 11:09:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:09:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:09:23,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2019-08-05 11:09:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:23,740 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:09:23,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:09:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:09:23,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:23,741 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:09:23,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2032794178, now seen corresponding path program 3 times [2019-08-05 11:09:23,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:23,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:09:23,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:09:23,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:23,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:09:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:09:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:09:23,803 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2019-08-05 11:09:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:23,905 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-08-05 11:09:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:09:23,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:09:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:23,906 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:09:23,906 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:09:23,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:09:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:09:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:09:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:09:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:09:23,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 11:09:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:23,908 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:09:23,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:09:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:09:23,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:09:23,914 INFO L202 PluginConnector]: Adding new model loop-nested.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:23 BoogieIcfgContainer [2019-08-05 11:09:23,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:23,918 INFO L168 Benchmark]: Toolchain (without parser) took 2005.21 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 110.8 MB in the beginning and 124.8 MB in the end (delta: -14.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,919 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.33 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,921 INFO L168 Benchmark]: Boogie Preprocessor took 21.29 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,922 INFO L168 Benchmark]: RCFGBuilder took 325.97 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 98.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,923 INFO L168 Benchmark]: TraceAbstraction took 1619.91 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 97.9 MB in the beginning and 124.8 MB in the end (delta: -26.9 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:23,927 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.33 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.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 21.29 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.97 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 98.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1619.91 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 97.9 MB in the beginning and 124.8 MB in the end (delta: -26.9 MB). Peak memory consumption was 8.7 MB. 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 1.5s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 5 SDslu, 3 SDs, 0 SdLazy, 91 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 7 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 6/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...