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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:07,964 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:07,966 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:07,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:07,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:07,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:07,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:07,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:07,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:07,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:07,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:07,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:08,001 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:08,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:08,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:08,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:08,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:08,011 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:08,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:08,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:08,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:08,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:08,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:08,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:08,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:08,033 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:08,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:08,034 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:08,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:08,035 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:08,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:08,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:08,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:08,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:08,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:08,042 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:08,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:08,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:08,043 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:43:08,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:08,111 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:08,115 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:08,116 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:08,117 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:08,118 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:43:08,119 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-05-15 10:43:08,165 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:08,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:08,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:08,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:08,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:08,187 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:43:08" (1/1) ... [2019-05-15 10:43:08,199 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:43:08" (1/1) ... [2019-05-15 10:43:08,208 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:43:08,209 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:43:08,209 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:43:08,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:08,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:08,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:08,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:08,225 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:43:08" (1/1) ... [2019-05-15 10:43:08,228 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:43:08" (1/1) ... [2019-05-15 10:43:08,228 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:43:08" (1/1) ... [2019-05-15 10:43:08,229 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:43:08" (1/1) ... [2019-05-15 10:43:08,233 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:43:08" (1/1) ... [2019-05-15 10:43:08,238 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:43:08" (1/1) ... [2019-05-15 10:43:08,240 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:43:08" (1/1) ... [2019-05-15 10:43:08,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:08,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:08,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:08,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:08,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:08" (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:43:08,319 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:43:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:43:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:43:08,729 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:43:08,730 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-05-15 10:43:08,731 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:08 BoogieIcfgContainer [2019-05-15 10:43:08,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:08,732 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:08,732 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:08,733 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:08,736 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:43:08" (1/1) ... [2019-05-15 10:43:08,822 INFO L632 onniauxMapEliminator]: L30 [2019-05-15 10:43:08,822 INFO L633 onniauxMapEliminator]: In Formula: (= v_a_1 (store v_a_2 v_i_4 0)) InVars {a=v_a_2, i=v_i_4} OutVars{a=v_a_1, i=v_i_4} AuxVars[] AssignedVars[a] [2019-05-15 10:43:08,823 INFO L634 onniauxMapEliminator]: Out Formula: (and (= v_a_val_0_out_1 v_a_val_0_in_1) (or (= 0 v_a_val_0_in_1) (not (= v_i_4 v_a_idx_0_term_1))) v_a_idx_0_term_assigned_1 (or (= v_i_4 v_a_idx_0_term_1) (not v_a_idx_0_term_assigned_1))) InVars {i=v_i_4, a_val_0=v_a_val_0_in_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_4, a_val_0=v_a_val_0_out_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_val_0] [2019-05-15 10:43:08,823 INFO L635 onniauxMapEliminator]: L31 [2019-05-15 10:43:08,852 INFO L632 onniauxMapEliminator]: L34 [2019-05-15 10:43:08,852 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:43:08,852 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:43:08,852 INFO L635 onniauxMapEliminator]: mainErr0ASSERT_VIOLATIONASSERT [2019-05-15 10:43:08,860 INFO L632 onniauxMapEliminator]: L34 [2019-05-15 10:43:08,861 INFO L633 onniauxMapEliminator]: In Formula: (= (select v_a_4 v_r_3) 0) InVars {a=v_a_4, r=v_r_3} OutVars{a=v_a_4, r=v_r_3} AuxVars[] AssignedVars[] [2019-05-15 10:43:08,861 INFO L634 onniauxMapEliminator]: Out Formula: (and (= 0 v_v_a_4_aux_1) (or (= v_r_3 v_a_idx_0_term_3) (not v_a_idx_0_term_assigned_1)) v_a_idx_0_term_assigned_1 (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not (= v_r_3 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_3} 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_3} AuxVars[v_v_a_4_aux_1] AssignedVars[] [2019-05-15 10:43:08,861 INFO L635 onniauxMapEliminator]: mainFINAL [2019-05-15 10:43:08,876 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:08 BasicIcfg [2019-05-15 10:43:08,877 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:08,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:08,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:08,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:08,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:08" (1/3) ... [2019-05-15 10:43:08,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f396c8f and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:43:08, skipping insertion in model container [2019-05-15 10:43:08,886 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:43:08" (2/3) ... [2019-05-15 10:43:08,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f396c8f and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:08, skipping insertion in model container [2019-05-15 10:43:08,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:08" (3/3) ... [2019-05-15 10:43:08,889 INFO L109 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bplME [2019-05-15 10:43:08,899 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:08,906 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:08,922 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:08,946 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:08,947 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:08,947 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:08,947 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:08,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:08,948 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:08,948 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:08,948 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:08,948 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-05-15 10:43:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:43:08,971 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:08,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:43:08,972 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash 42022257, now seen corresponding path program 1 times [2019-05-15 10:43:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:43:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:09,269 INFO L273 TraceCheckUtils]: 0: Hoare triple {13#true} [14] mainENTRY-->L27: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] {18#(<= i 0)} is VALID [2019-05-15 10:43:09,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {18#(<= i 0)} [15] L27-->L29-1: Formula: (= v_j_1 v_i_2) InVars {j=v_j_1, i=v_i_2} OutVars{j=v_j_1, i=v_i_2} AuxVars[] AssignedVars[] {18#(<= i 0)} is VALID [2019-05-15 10:43:09,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {18#(<= i 0)} [17] L29-1-->L33: Formula: (not (< v_i_7 v_n_2)) InVars {n=v_n_2, i=v_i_7} OutVars{n=v_n_2, i=v_i_7} AuxVars[] AssignedVars[] {25#(<= n 0)} is VALID [2019-05-15 10:43:09,277 INFO L273 TraceCheckUtils]: 3: Hoare triple {25#(<= n 0)} [19] L33-->L34: Formula: (and (< v_r_1 v_n_3) (<= 0 v_r_1)) InVars {n=v_n_3, r=v_r_1} OutVars{n=v_n_3, r=v_r_1} AuxVars[] AssignedVars[] {14#false} is VALID [2019-05-15 10:43:09,277 INFO L273 TraceCheckUtils]: 4: Hoare triple {14#false} [21] 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[] {14#false} is VALID [2019-05-15 10:43:09,279 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:43:09,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:09,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-15 10:43:09,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:43:09,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:09,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:43:09,342 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:43:09,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:43:09,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:43:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:09,356 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2019-05-15 10:43:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:09,802 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:43:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:43:09,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:43:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-05-15 10:43:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-05-15 10:43:09,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-05-15 10:43:09,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:09,891 INFO L225 Difference]: With dead ends: 14 [2019-05-15 10:43:09,891 INFO L226 Difference]: Without dead ends: 11 [2019-05-15 10:43:09,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:43:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-05-15 10:43:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-05-15 10:43:09,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:09,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-05-15 10:43:09,917 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-05-15 10:43:09,917 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-05-15 10:43:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:09,919 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:43:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:43:09,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:09,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:09,920 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-05-15 10:43:09,921 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-05-15 10:43:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:09,923 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:43:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:43:09,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:09,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:09,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:09,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:43:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-15 10:43:09,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-05-15 10:43:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:09,927 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-05-15 10:43:09,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:43:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:43:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:43:09,928 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:09,928 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:09,928 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2020009635, now seen corresponding path program 1 times [2019-05-15 10:43:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:43:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:10,230 INFO L273 TraceCheckUtils]: 0: Hoare triple {78#true} [14] mainENTRY-->L27: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] {78#true} is VALID [2019-05-15 10:43:10,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {78#true} [15] L27-->L29-1: Formula: (= v_j_1 v_i_2) InVars {j=v_j_1, i=v_i_2} OutVars{j=v_j_1, i=v_i_2} AuxVars[] AssignedVars[] {78#true} is VALID [2019-05-15 10:43:10,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {78#true} [16] L29-1-->L30: Formula: (< v_i_3 v_n_1) InVars {n=v_n_1, i=v_i_3} OutVars{n=v_n_1, i=v_i_3} AuxVars[] AssignedVars[] {78#true} is VALID [2019-05-15 10:43:10,232 INFO L273 TraceCheckUtils]: 3: Hoare triple {78#true} [18] L30-->L31: Formula: (let ((.cse0 (= v_i_4 v_a_idx_0_term_1))) (and (= v_a_val_0_out_1 v_a_val_0_in_1) (or (= 0 v_a_val_0_in_1) (not .cse0)) v_a_idx_0_term_assigned_1 (or .cse0 (not v_a_idx_0_term_assigned_1)))) InVars {i=v_i_4, a_val_0=v_a_val_0_in_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_4, a_val_0=v_a_val_0_out_1, a_idx_0_bool=v_a_idx_0_term_assigned_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_val_0] {92#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:43:10,233 INFO L273 TraceCheckUtils]: 4: Hoare triple {92#(and (= a_val_0 0) a_idx_0_bool)} [20] L31-->L29-1: Formula: (= v_i_5 (+ v_i_6 1)) InVars {i=v_i_6} OutVars{i=v_i_5} AuxVars[] AssignedVars[i] {92#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:43:10,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {92#(and (= a_val_0 0) a_idx_0_bool)} [17] L29-1-->L33: Formula: (not (< v_i_7 v_n_2)) InVars {n=v_n_2, i=v_i_7} OutVars{n=v_n_2, i=v_i_7} AuxVars[] AssignedVars[] {92#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:43:10,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {92#(and (= a_val_0 0) a_idx_0_bool)} [19] L33-->L34: Formula: (and (< v_r_1 v_n_3) (<= 0 v_r_1)) InVars {n=v_n_3, r=v_r_1} OutVars{n=v_n_3, r=v_r_1} AuxVars[] AssignedVars[] {92#(and (= a_val_0 0) a_idx_0_bool)} is VALID [2019-05-15 10:43:10,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {92#(and (= a_val_0 0) a_idx_0_bool)} [21] 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[] {79#false} is VALID [2019-05-15 10:43:10,236 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:43:10,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:10,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:43:10,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-05-15 10:43:10,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:10,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:43:10,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:10,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:43:10,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:43:10,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:43:10,284 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-05-15 10:43:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,337 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:43:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:43:10,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-05-15 10:43:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-05-15 10:43:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-05-15 10:43:10,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-05-15 10:43:10,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:10,416 INFO L225 Difference]: With dead ends: 9 [2019-05-15 10:43:10,416 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:10,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:43:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:10,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:10,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:10,418 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:10,419 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,420 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:10,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:10,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:10,421 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:10,421 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,422 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:10,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:10,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:10,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:10,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:10,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-05-15 10:43:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:10,424 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:10,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:43:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:10,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:10,430 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:10,434 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:10 BasicIcfg [2019-05-15 10:43:10,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:10,437 INFO L168 Benchmark]: Toolchain (without parser) took 2271.04 ms. Allocated memory was 136.3 MB in the beginning and 170.4 MB in the end (delta: 34.1 MB). Free memory was 111.2 MB in the beginning and 124.1 MB in the end (delta: -12.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:10,440 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 136.3 MB. Free memory is still 112.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:10,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.43 ms. Allocated memory is still 136.3 MB. Free memory was 111.2 MB in the beginning and 109.2 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:43:10,446 INFO L168 Benchmark]: Boogie Preprocessor took 28.19 ms. Allocated memory is still 136.3 MB. Free memory was 109.2 MB in the beginning and 108.1 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:43:10,448 INFO L168 Benchmark]: RCFGBuilder took 489.66 ms. Allocated memory is still 136.3 MB. Free memory was 108.1 MB in the beginning and 97.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:10,449 INFO L168 Benchmark]: IcfgTransformer took 145.21 ms. Allocated memory is still 136.3 MB. Free memory was 97.3 MB in the beginning and 93.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:10,450 INFO L168 Benchmark]: TraceAbstraction took 1557.56 ms. Allocated memory was 136.3 MB in the beginning and 170.4 MB in the end (delta: 34.1 MB). Free memory was 92.7 MB in the beginning and 124.1 MB in the end (delta: -31.4 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:10,460 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.27 ms. Allocated memory is still 136.3 MB. Free memory is still 112.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.43 ms. Allocated memory is still 136.3 MB. Free memory was 111.2 MB in the beginning and 109.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.19 ms. Allocated memory is still 136.3 MB. Free memory was 109.2 MB in the beginning and 108.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 489.66 ms. Allocated memory is still 136.3 MB. Free memory was 108.1 MB in the beginning and 97.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * IcfgTransformer took 145.21 ms. Allocated memory is still 136.3 MB. Free memory was 97.3 MB in the beginning and 93.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1557.56 ms. Allocated memory was 136.3 MB in the beginning and 170.4 MB in the end (delta: 34.1 MB). Free memory was 92.7 MB in the beginning and 124.1 MB in the end (delta: -31.4 MB). Peak memory consumption was 2.7 MB. 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, 10 locations, 1 error locations. SAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 4 SDslu, 14 SDs, 0 SdLazy, 23 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 4 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...