java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:05,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:05,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:05,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:05,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:05,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:05,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:05,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:05,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:05,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:05,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:05,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:05,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:05,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:05,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:05,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:05,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:05,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:05,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:05,413 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:05,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:05,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:05,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:05,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:05,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:05,419 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:05,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:05,420 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:05,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:05,422 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:05,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:05,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:05,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:05,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:05,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:05,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:05,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:05,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:05,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX [2019-05-15 10:56:05,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:05,477 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:05,480 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:05,481 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:05,481 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:05,482 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-05-15 10:56:05,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-05-15 10:56:05,515 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:05,517 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:05,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:05,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:05,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:05,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,546 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:56:05,546 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:56:05,546 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:56:05,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:05,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:05,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:05,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:05,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/1) ... [2019-05-15 10:56:05,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:05,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:05,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:05,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:05,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (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-05-15 10:56:05,641 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:56:05,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:56:05,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:56:06,023 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:56:06,024 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-05-15 10:56:06,025 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:06 BoogieIcfgContainer [2019-05-15 10:56:06,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:06,026 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:06,026 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:06,027 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:06,034 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:06" (1/1) ... [2019-05-15 10:56:06,106 INFO L632 onniauxMapEliminator]: L29-1 [2019-05-15 10:56:06,107 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_i_2 (+ v_i_3 1)) (= v_a_1 (store v_a_2 v_i_3 0)) (< v_i_3 v_n_1)) InVars {a=v_a_2, n=v_n_1, i=v_i_3} OutVars{a=v_a_1, n=v_n_1, i=v_i_2} AuxVars[] AssignedVars[a, i] [2019-05-15 10:56:06,107 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_i_3 v_a_idx_0_term_1) (not v_a_idx_0_term_assigned_1)) (= v_i_2 (+ v_i_3 1)) (= v_a_val_0_out_1 v_a_val_0_in_1) (< v_i_3 v_n_1) v_a_idx_0_term_assigned_1 (or (= 0 v_a_val_0_in_1) (not (= v_i_3 v_a_idx_0_term_1)))) InVars {i=v_i_3, a_val_0=v_a_val_0_in_1, n=v_n_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} OutVars{i=v_i_2, a_val_0=v_a_val_0_out_1, n=v_n_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[i, a_val_0] [2019-05-15 10:56:06,107 INFO L635 onniauxMapEliminator]: L29-1 [2019-05-15 10:56:06,128 INFO L632 onniauxMapEliminator]: L34 [2019-05-15 10:56:06,129 INFO L633 onniauxMapEliminator]: In Formula: (not (= 0 (select v_a_3 v_r_2))) InVars {a=v_a_3, r=v_r_2} OutVars{a=v_a_3, r=v_r_2} AuxVars[] AssignedVars[] [2019-05-15 10:56:06,129 INFO L634 onniauxMapEliminator]: Out Formula: (and (not (= 0 v_v_a_3_aux_1)) (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not (= v_r_2 v_a_idx_0_term_2))) v_a_idx_0_term_assigned_1 (or (not v_a_idx_0_term_assigned_1) (= v_r_2 v_a_idx_0_term_2))) InVars {a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} OutVars{a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} AuxVars[v_v_a_3_aux_1] AssignedVars[] [2019-05-15 10:56:06,130 INFO L635 onniauxMapEliminator]: mainErr0ASSERT_VIOLATIONASSERT [2019-05-15 10:56:06,150 INFO L632 onniauxMapEliminator]: L34 [2019-05-15 10:56:06,151 INFO L633 onniauxMapEliminator]: In Formula: (= 0 (select v_a_5 v_r_4)) InVars {a=v_a_5, r=v_r_4} OutVars{a=v_a_5, r=v_r_4} AuxVars[] AssignedVars[] [2019-05-15 10:56:06,151 INFO L634 onniauxMapEliminator]: Out Formula: (and (= 0 v_v_a_5_aux_1) (or (= v_r_4 v_a_idx_0_term_3) (not v_a_idx_0_term_assigned_1)) v_a_idx_0_term_assigned_1 (or (= v_a_val_0_in_3 v_v_a_5_aux_1) (not (= v_r_4 v_a_idx_0_term_3)))) InVars {a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3, r=v_r_4} OutVars{a_val_0=v_a_val_0_in_3, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_3, r=v_r_4} AuxVars[v_v_a_5_aux_1] AssignedVars[] [2019-05-15 10:56:06,151 INFO L635 onniauxMapEliminator]: mainEXIT [2019-05-15 10:56:06,163 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:06 BasicIcfg [2019-05-15 10:56:06,163 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:06,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:06,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:06,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:06,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:05" (1/3) ... [2019-05-15 10:56:06,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e3c76a and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:06, skipping insertion in model container [2019-05-15 10:56:06,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:06" (2/3) ... [2019-05-15 10:56:06,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e3c76a and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:06, skipping insertion in model container [2019-05-15 10:56:06,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:06" (3/3) ... [2019-05-15 10:56:06,172 INFO L109 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bplME [2019-05-15 10:56:06,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:06,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:06,212 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:06,247 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:06,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:06,248 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:06,248 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:06,248 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:06,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:06,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:06,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:06,249 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:06,282 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:06,283 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 40779, now seen corresponding path program 1 times [2019-05-15 10:56:06,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:06,556 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [11] mainENTRY-->L29-1: Formula: (and (= v_i_1 0) (= v_j_1 v_i_1)) InVars {j=v_j_1} OutVars{j=v_j_1, i=v_i_1} AuxVars[] AssignedVars[i] {13#(<= i 0)} is VALID [2019-05-15 10:56:06,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(<= i 0)} [13] L29-1-->L34: Formula: (and (< v_r_1 v_n_2) (not (< v_i_4 v_n_2)) (<= 0 v_r_1)) InVars {n=v_n_2, i=v_i_4, r=v_r_1} OutVars{n=v_n_2, i=v_i_4, r=v_r_1} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:06,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [14] L34-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (let ((.cse0 (= v_r_2 v_a_idx_0_term_2))) (and (not (= 0 v_v_a_3_aux_1)) (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not .cse0)) v_a_idx_0_term_assigned_1 (or (not v_a_idx_0_term_assigned_1) .cse0))) InVars {a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} OutVars{a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} AuxVars[v_v_a_3_aux_1] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:06,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:06,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:06,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:06,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:06,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:06,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:06,612 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,740 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:56:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:06,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-05-15 10:56:06,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-05-15 10:56:06,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:06,795 INFO L225 Difference]: With dead ends: 6 [2019-05-15 10:56:06,796 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:06,798 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-05-15 10:56:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:06,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:06,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:06,820 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:06,821 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,822 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:06,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,824 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:06,824 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:06,825 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:06,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:06,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:06,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:06,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:06,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:06,829 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:06,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:06,830 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:06,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:06,831 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1263171, now seen corresponding path program 1 times [2019-05-15 10:56:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:56:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:06,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:07,068 INFO L273 TraceCheckUtils]: 0: Hoare triple {40#true} [11] mainENTRY-->L29-1: Formula: (and (= v_i_1 0) (= v_j_1 v_i_1)) InVars {j=v_j_1} OutVars{j=v_j_1, i=v_i_1} AuxVars[] AssignedVars[i] {40#true} is VALID [2019-05-15 10:56:07,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} [12] L29-1-->L29-1: Formula: (let ((.cse0 (= v_i_3 v_a_idx_0_term_1))) (and (or .cse0 (not v_a_idx_0_term_assigned_1)) (= v_i_2 (+ v_i_3 1)) (= v_a_val_0_out_1 v_a_val_0_in_1) (< v_i_3 v_n_1) v_a_idx_0_term_assigned_1 (or (= 0 v_a_val_0_in_1) (not .cse0)))) InVars {i=v_i_3, a_val_0=v_a_val_0_in_1, n=v_n_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} OutVars{i=v_i_2, a_val_0=v_a_val_0_out_1, n=v_n_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[i, a_val_0] {48#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:56:07,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (= a_val_0 0) a_idx_0_bool)} [13] L29-1-->L34: Formula: (and (< v_r_1 v_n_2) (not (< v_i_4 v_n_2)) (<= 0 v_r_1)) InVars {n=v_n_2, i=v_i_4, r=v_r_1} OutVars{n=v_n_2, i=v_i_4, r=v_r_1} AuxVars[] AssignedVars[] {48#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:56:07,078 INFO L273 TraceCheckUtils]: 3: Hoare triple {48#(and (= a_val_0 0) a_idx_0_bool)} [14] L34-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (let ((.cse0 (= v_r_2 v_a_idx_0_term_2))) (and (not (= 0 v_v_a_3_aux_1)) (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not .cse0)) v_a_idx_0_term_assigned_1 (or (not v_a_idx_0_term_assigned_1) .cse0))) InVars {a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} OutVars{a_val_0=v_a_val_0_in_2, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_2, r=v_r_2} AuxVars[v_v_a_3_aux_1] AssignedVars[] {41#false} is VALID [2019-05-15 10:56:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:56:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:07,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:07,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:07,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:07,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:07,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:07,105 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 3 states. [2019-05-15 10:56:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,157 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-05-15 10:56:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:07,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:56:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-05-15 10:56:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-05-15 10:56:07,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5 transitions. [2019-05-15 10:56:07,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:07,171 INFO L225 Difference]: With dead ends: 4 [2019-05-15 10:56:07,172 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:07,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-05-15 10:56:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:07,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:07,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,174 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,175 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,175 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,176 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,176 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:07,176 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:07,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:07,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:07,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-05-15 10:56:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:07,178 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:07,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:07,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:07,183 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:07,185 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:07 BasicIcfg [2019-05-15 10:56:07,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:07,187 INFO L168 Benchmark]: Toolchain (without parser) took 1671.77 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 110.9 MB in the beginning and 136.4 MB in the end (delta: -25.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,190 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 134.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:07,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.98 ms. Allocated memory is still 134.7 MB. Free memory was 110.9 MB in the beginning and 108.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,192 INFO L168 Benchmark]: Boogie Preprocessor took 22.10 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 107.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,193 INFO L168 Benchmark]: RCFGBuilder took 454.27 ms. Allocated memory is still 134.7 MB. Free memory was 107.8 MB in the beginning and 97.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,194 INFO L168 Benchmark]: IcfgTransformer took 137.31 ms. Allocated memory is still 134.7 MB. Free memory was 97.7 MB in the beginning and 93.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:07,195 INFO L168 Benchmark]: TraceAbstraction took 1021.76 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 93.6 MB in the beginning and 136.4 MB in the end (delta: -42.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:07,200 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 134.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.98 ms. Allocated memory is still 134.7 MB. Free memory was 110.9 MB in the beginning and 108.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.10 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 107.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 454.27 ms. Allocated memory is still 134.7 MB. Free memory was 107.8 MB in the beginning and 97.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 137.31 ms. Allocated memory is still 134.7 MB. Free memory was 97.7 MB in the beginning and 93.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1021.76 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 93.6 MB in the beginning and 136.4 MB in the end (delta: -42.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: 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, 5 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 6 SDs, 0 SdLazy, 9 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 3 NumberOfNonLiveVariables, 34 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...