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/ValueTerminatedArrayIteration01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:56:09,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:56:09,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:56:09,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:56:09,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:56:09,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:56:09,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:56:09,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:56:09,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:56:09,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:56:09,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:56:09,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:56:09,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:56:09,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:56:09,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:56:09,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:56:09,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:56:09,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:56:09,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:56:09,713 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:56:09,714 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:56:09,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:56:09,719 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:56:09,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:56:09,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:56:09,720 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:56:09,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:56:09,725 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:56:09,725 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:56:09,727 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:56:09,729 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:56:09,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:56:09,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:56:09,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:56:09,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:56:09,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:56:09,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:56:09,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:56:09,737 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:09,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:09,799 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:09,803 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:09,804 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:09,805 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:09,805 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2019-05-15 10:56:09,806 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-05-15 10:56:09,837 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:09,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:09,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:09,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:09,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:09,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,873 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:56:09,873 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:56:09,873 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:56:09,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:09,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:09,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:09,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:09,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/1) ... [2019-05-15 10:56:09,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:09,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:09,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:09,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:09,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (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:09,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:56:09,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:56:09,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:56:10,209 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:56:10,210 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-05-15 10:56:10,211 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:10 BoogieIcfgContainer [2019-05-15 10:56:10,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:10,213 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:10,213 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:10,215 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:10,218 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:10" (1/1) ... [2019-05-15 10:56:10,332 INFO L632 onniauxMapEliminator]: mainENTRY [2019-05-15 10:56:10,332 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_i_1 0) (<= 0 v_end_1) (= v_a_1 (store v_a_2 v_end_1 42))) InVars {a=v_a_2, end=v_end_1} OutVars{a=v_a_1, i=v_i_1, end=v_end_1} AuxVars[] AssignedVars[a, i] [2019-05-15 10:56:10,333 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_end_1 v_a_idx_0_term_1) (not v_a_idx_0_term_assigned_1)) (= v_i_1 0) (= v_a_val_0_out_1 v_a_val_0_in_1) (<= 0 v_end_1) v_a_idx_0_term_assigned_1 (or (= 42 v_a_val_0_in_1) (not (= v_end_1 v_a_idx_0_term_1)))) InVars {end=v_end_1, 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_1, end=v_end_1, 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[i, a_val_0] [2019-05-15 10:56:10,333 INFO L635 onniauxMapEliminator]: L17-1 [2019-05-15 10:56:10,346 INFO L632 onniauxMapEliminator]: L17-1 [2019-05-15 10:56:10,346 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_i_2 (+ v_i_3 1)) (not (= (select v_a_3 v_i_3) 42))) InVars {a=v_a_3, i=v_i_3} OutVars{a=v_a_3, i=v_i_2} AuxVars[] AssignedVars[i] [2019-05-15 10:56:10,346 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_i_3 v_a_idx_0_term_2) (not v_a_idx_0_term_assigned_1)) (= v_i_2 (+ v_i_3 1)) (not (= 42 v_v_a_3_aux_1)) (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not (= v_i_3 v_a_idx_0_term_2))) v_a_idx_0_term_assigned_1) InVars {i=v_i_3, 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} OutVars{i=v_i_2, 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} AuxVars[v_v_a_3_aux_1] AssignedVars[i] [2019-05-15 10:56:10,346 INFO L635 onniauxMapEliminator]: L17-1 [2019-05-15 10:56:10,356 INFO L632 onniauxMapEliminator]: L17-1 [2019-05-15 10:56:10,356 INFO L633 onniauxMapEliminator]: In Formula: (= (select v_a_4 v_i_4) 42) InVars {a=v_a_4, i=v_i_4} OutVars{a=v_a_4, i=v_i_4} AuxVars[] AssignedVars[] [2019-05-15 10:56:10,358 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not (= v_i_4 v_a_idx_0_term_3))) (or (= v_i_4 v_a_idx_0_term_3) (not v_a_idx_0_term_assigned_1)) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1) InVars {i=v_i_4, 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} OutVars{i=v_i_4, 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} AuxVars[v_v_a_4_aux_1] AssignedVars[] [2019-05-15 10:56:10,358 INFO L635 onniauxMapEliminator]: L20 [2019-05-15 10:56:10,375 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:10 BasicIcfg [2019-05-15 10:56:10,375 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:10,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:10,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:10,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:10,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:09" (1/3) ... [2019-05-15 10:56:10,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698a45e and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:10, skipping insertion in model container [2019-05-15 10:56:10,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:10" (2/3) ... [2019-05-15 10:56:10,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698a45e and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:10, skipping insertion in model container [2019-05-15 10:56:10,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:10" (3/3) ... [2019-05-15 10:56:10,383 INFO L109 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bplME [2019-05-15 10:56:10,392 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:10,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:10,413 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:10,438 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:10,439 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:10,439 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:10,439 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:10,439 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:10,439 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:10,440 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:10,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:10,440 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:10,463 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:10,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:10,466 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 40779, now seen corresponding path program 1 times [2019-05-15 10:56:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:10,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:56:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:10,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:10,678 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [11] mainENTRY-->L17-1: Formula: (let ((.cse0 (= v_end_1 v_a_idx_0_term_1))) (and (or .cse0 (not v_a_idx_0_term_assigned_1)) (= v_i_1 0) (= v_a_val_0_out_1 v_a_val_0_in_1) (<= 0 v_end_1) v_a_idx_0_term_assigned_1 (or (= 42 v_a_val_0_in_1) (not .cse0)))) InVars {end=v_end_1, 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_1, end=v_end_1, 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[i, a_val_0] {13#(and (<= i 0) (<= 0 end))} is VALID [2019-05-15 10:56:10,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (<= i 0) (<= 0 end))} [13] L17-1-->L20: Formula: (let ((.cse0 (= v_i_4 v_a_idx_0_term_3))) (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not .cse0)) (or .cse0 (not v_a_idx_0_term_assigned_1)) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1)) InVars {i=v_i_4, 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} OutVars{i=v_i_4, 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} AuxVars[v_v_a_4_aux_1] AssignedVars[] {13#(and (<= i 0) (<= 0 end))} is VALID [2019-05-15 10:56:10,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {13#(and (<= i 0) (<= 0 end))} [14] L20-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_i_5 v_end_2)) InVars {i=v_i_5, end=v_end_2} OutVars{i=v_i_5, end=v_end_2} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:10,688 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:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:56:10,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:10,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:10,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:10,713 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:10,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:10,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:10,724 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:10,858 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:56:10,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:10,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-05-15 10:56:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-05-15 10:56:10,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-05-15 10:56:10,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:56:10,899 INFO L225 Difference]: With dead ends: 8 [2019-05-15 10:56:10,899 INFO L226 Difference]: Without dead ends: 5 [2019-05-15 10:56:10,901 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:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-05-15 10:56:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-05-15 10:56:10,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:10,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:10,927 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:10,927 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:10,929 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:10,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:10,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:10,930 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:10,930 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-05-15 10:56:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:10,932 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-05-15 10:56:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:10,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:10,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:10,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:10,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:56:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-05-15 10:56:10,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-05-15 10:56:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:10,936 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-05-15 10:56:10,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-05-15 10:56:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:56:10,937 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:10,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:56:10,938 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1263171, now seen corresponding path program 1 times [2019-05-15 10:56:10,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:10,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:56:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:10,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:11,186 INFO L273 TraceCheckUtils]: 0: Hoare triple {42#true} [11] mainENTRY-->L17-1: Formula: (let ((.cse0 (= v_end_1 v_a_idx_0_term_1))) (and (or .cse0 (not v_a_idx_0_term_assigned_1)) (= v_i_1 0) (= v_a_val_0_out_1 v_a_val_0_in_1) (<= 0 v_end_1) v_a_idx_0_term_assigned_1 (or (= 42 v_a_val_0_in_1) (not .cse0)))) InVars {end=v_end_1, 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_1, end=v_end_1, 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[i, a_val_0] {47#(and (= a_idx_0 end) a_idx_0_bool)} is VALID [2019-05-15 10:56:11,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (= a_idx_0 end) a_idx_0_bool)} [12] L17-1-->L17-1: Formula: (let ((.cse0 (= v_i_3 v_a_idx_0_term_2))) (and (or .cse0 (not v_a_idx_0_term_assigned_1)) (= v_i_2 (+ v_i_3 1)) (not (= 42 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)) InVars {i=v_i_3, 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} OutVars{i=v_i_2, 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} AuxVars[v_v_a_3_aux_1] AssignedVars[i] {47#(and (= a_idx_0 end) a_idx_0_bool)} is VALID [2019-05-15 10:56:11,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(and (= a_idx_0 end) a_idx_0_bool)} [13] L17-1-->L20: Formula: (let ((.cse0 (= v_i_4 v_a_idx_0_term_3))) (and (or (= v_v_a_4_aux_1 v_a_val_0_in_3) (not .cse0)) (or .cse0 (not v_a_idx_0_term_assigned_1)) (= 42 v_v_a_4_aux_1) v_a_idx_0_term_assigned_1)) InVars {i=v_i_4, 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} OutVars{i=v_i_4, 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} AuxVars[v_v_a_4_aux_1] AssignedVars[] {54#(= end i)} is VALID [2019-05-15 10:56:11,210 INFO L273 TraceCheckUtils]: 3: Hoare triple {54#(= end i)} [14] L20-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_i_5 v_end_2)) InVars {i=v_i_5, end=v_end_2} OutVars{i=v_i_5, end=v_end_2} AuxVars[] AssignedVars[] {43#false} is VALID [2019-05-15 10:56:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-05-15 10:56:11,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:11,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:11,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:11,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:11,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:56:11,226 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:11,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:56:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:56:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:56:11,227 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-05-15 10:56:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:11,277 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-05-15 10:56:11,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:56:11,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-05-15 10:56:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:56:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-05-15 10:56:11,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-05-15 10:56:11,321 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:11,322 INFO L225 Difference]: With dead ends: 4 [2019-05-15 10:56:11,322 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:11,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:56:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:11,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:11,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:11,325 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:11,325 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:11,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:11,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:11,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:11,326 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:11,326 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:11,326 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:11,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:11,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:11,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:11,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:11,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-05-15 10:56:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:11,328 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:11,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:56:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:11,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:11,332 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:11,334 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:11 BasicIcfg [2019-05-15 10:56:11,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:11,335 INFO L168 Benchmark]: Toolchain (without parser) took 1497.80 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 112.3 MB in the beginning and 134.5 MB in the end (delta: -22.2 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:11,338 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory is still 113.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:11,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:11,340 INFO L168 Benchmark]: Boogie Preprocessor took 18.18 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.4 MB in the end (delta: 839.4 kB). Peak memory consumption was 839.4 kB. Max. memory is 7.1 GB. [2019-05-15 10:56:11,341 INFO L168 Benchmark]: RCFGBuilder took 317.56 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 98.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:11,342 INFO L168 Benchmark]: IcfgTransformer took 162.41 ms. Allocated memory is still 134.7 MB. Free memory was 98.6 MB in the beginning and 94.7 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:11,342 INFO L168 Benchmark]: TraceAbstraction took 957.64 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 94.7 MB in the beginning and 134.5 MB in the end (delta: -39.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:11,350 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.22 ms. Allocated memory is still 134.7 MB. Free memory is still 113.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.18 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.4 MB in the end (delta: 839.4 kB). Peak memory consumption was 839.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 317.56 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 98.6 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * IcfgTransformer took 162.41 ms. Allocated memory is still 134.7 MB. Free memory was 98.6 MB in the beginning and 94.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 957.64 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 94.7 MB in the beginning and 134.5 MB in the end (delta: -39.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: assertion always holds For all program executions holds that assertion always holds at this location - 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: 1 SDtfs, 2 SDslu, 2 SDs, 0 SdLazy, 13 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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, 67 SizeOfPredicates, 2 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 7 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...