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-48de6b2 [2019-04-26 16:10:00,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-26 16:10:00,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-26 16:10:00,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-26 16:10:00,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-26 16:10:00,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-26 16:10:00,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-26 16:10:00,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-26 16:10:00,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-26 16:10:00,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-26 16:10:00,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-26 16:10:00,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-26 16:10:00,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-26 16:10:00,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-26 16:10:00,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-26 16:10:00,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-26 16:10:00,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-26 16:10:00,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-26 16:10:00,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-26 16:10:00,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-26 16:10:00,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-26 16:10:00,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-26 16:10:00,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-26 16:10:00,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-26 16:10:00,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-26 16:10:00,270 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-26 16:10:00,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-26 16:10:00,272 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-26 16:10:00,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-26 16:10:00,275 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-26 16:10:00,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-26 16:10:00,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-26 16:10:00,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-26 16:10:00,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-26 16:10:00,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-26 16:10:00,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-26 16:10:00,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-26 16:10:00,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-26 16:10:00,285 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-04-26 16:10:00,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-26 16:10:00,346 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-26 16:10:00,350 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-26 16:10:00,351 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-04-26 16:10:00,352 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-04-26 16:10:00,353 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-04-26 16:10:00,353 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-04-26 16:10:00,396 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-26 16:10:00,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-26 16:10:00,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-04-26 16:10:00,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-04-26 16:10:00,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-04-26 16:10:00,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,437 WARN L165 Inliner]: Program contained no entry procedure! [2019-04-26 16:10:00,437 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-04-26 16:10:00,437 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-04-26 16:10:00,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-04-26 16:10:00,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-26 16:10:00,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-26 16:10:00,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-26 16:10:00,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-26 16:10:00,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-26 16:10:00,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-26 16:10:00,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-26 16:10:00,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (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-04-26 16:10:00,540 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-04-26 16:10:00,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-04-26 16:10:00,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-04-26 16:10:00,801 INFO L278 CfgBuilder]: Using library mode [2019-04-26 16:10:00,801 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-04-26 16:10:00,802 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:00 BoogieIcfgContainer [2019-04-26 16:10:00,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-26 16:10:00,803 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-04-26 16:10:00,803 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-04-26 16:10:00,804 INFO L276 PluginConnector]: IcfgTransformer initialized [2019-04-26 16:10:00,808 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:00" (1/1) ... [2019-04-26 16:10:00,834 INFO L359 onniauxMapEliminator]: L29-1 [2019-04-26 16:10:00,834 INFO L360 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-04-26 16:10:00,834 INFO L361 onniauxMapEliminator]: Out Formula: (and (= v_i_2 (+ v_i_3 1)) (= v_i_3 v_a_idx_0_term_1) (< v_i_3 v_n_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} OutVars{i=v_i_2, a_val_0=v_a_val_0_out_1, n=v_n_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_idx_0, i, a_val_0] [2019-04-26 16:10:00,835 INFO L362 onniauxMapEliminator]: L29-1 [2019-04-26 16:10:00,837 INFO L359 onniauxMapEliminator]: L34 [2019-04-26 16:10:00,837 INFO L360 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-04-26 16:10:00,838 INFO L361 onniauxMapEliminator]: Out Formula: (and (or (= v_a_idx_0_term_2 v_a_idx_0_term_1) (= v_r_2 v_a_idx_0_term_2)) (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)))) InVars {a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_1, r=v_r_2} OutVars{a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_2, r=v_r_2} AuxVars[v_v_a_3_aux_1] AssignedVars[a_idx_0] [2019-04-26 16:10:00,838 INFO L362 onniauxMapEliminator]: mainErr0ASSERT_VIOLATIONASSERT [2019-04-26 16:10:00,842 INFO L359 onniauxMapEliminator]: L34 [2019-04-26 16:10:00,842 INFO L360 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-04-26 16:10:00,842 INFO L361 onniauxMapEliminator]: Out Formula: (and (or (= v_a_idx_0_term_3 v_a_idx_0_term_2) (= v_r_4 v_a_idx_0_term_3)) (= 0 v_v_a_5_aux_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=v_a_idx_0_term_2, r=v_r_4} OutVars{a_val_0=v_a_val_0_in_3, a_idx_0=v_a_idx_0_term_3, r=v_r_4} AuxVars[v_v_a_5_aux_1] AssignedVars[a_idx_0] [2019-04-26 16:10:00,843 INFO L362 onniauxMapEliminator]: mainEXIT [2019-04-26 16:10:00,854 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:10:00 BasicIcfg [2019-04-26 16:10:00,854 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-04-26 16:10:00,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-26 16:10:00,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-26 16:10:00,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-26 16:10:00,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:00" (1/3) ... [2019-04-26 16:10:00,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b1e228 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.04 04:10:00, skipping insertion in model container [2019-04-26 16:10:00,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:00" (2/3) ... [2019-04-26 16:10:00,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b1e228 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:10:00, skipping insertion in model container [2019-04-26 16:10:00,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:10:00" (3/3) ... [2019-04-26 16:10:00,863 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bplME [2019-04-26 16:10:00,873 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-26 16:10:00,880 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-04-26 16:10:00,897 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-26 16:10:00,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-04-26 16:10:00,921 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-26 16:10:00,921 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-26 16:10:00,921 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-26 16:10:00,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-26 16:10:00,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-26 16:10:00,922 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-26 16:10:00,922 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-26 16:10:00,922 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-04-26 16:10:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-04-26 16:10:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-26 16:10:00,943 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:10:00,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-26 16:10:00,944 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:10:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:10:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 40779, now seen corresponding path program 1 times [2019-04-26 16:10:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:10:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:01,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-04-26 16:10:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:10:01,281 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-04-26 16:10:01,284 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-04-26 16:10:01,284 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 (or (= v_a_idx_0_term_2 v_a_idx_0_term_1) .cse0) (not (= 0 v_v_a_3_aux_1)) (or (= v_v_a_3_aux_1 v_a_val_0_in_2) (not .cse0)))) InVars {a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_1, r=v_r_2} OutVars{a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_2, r=v_r_2} AuxVars[v_v_a_3_aux_1] AssignedVars[a_idx_0] {9#false} is VALID [2019-04-26 16:10:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-04-26 16:10:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-26 16:10:01,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-04-26 16:10:01,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:10:01,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:10:01,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-04-26 16:10:01,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:01,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-26 16:10:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-26 16:10:01,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:10:01,361 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-04-26 16:10:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:01,446 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-04-26 16:10:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-26 16:10:01,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:10:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:10:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:10:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:10:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:10:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-04-26 16:10:01,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 7 transitions. [2019-04-26 16:10:01,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:01,509 INFO L225 Difference]: With dead ends: 6 [2019-04-26 16:10:01,510 INFO L226 Difference]: Without dead ends: 5 [2019-04-26 16:10:01,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:10:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-04-26 16:10:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-04-26 16:10:01,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:10:01,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:01,539 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:01,539 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:01,541 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:10:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:01,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:01,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:01,542 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:01,542 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:01,544 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:10:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:01,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:01,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:01,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:10:01,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:10:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:10:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-04-26 16:10:01,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-04-26 16:10:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:10:01,549 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-04-26 16:10:01,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-26 16:10:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:01,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-26 16:10:01,550 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:10:01,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-26 16:10:01,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:10:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:10:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1263171, now seen corresponding path program 1 times [2019-04-26 16:10:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:10:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:10:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:10:01,614 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-26 16:10:01,620 INFO L85 mationBacktranslator]: Skipped ATE [11] [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] [2019-04-26 16:10:01,620 INFO L85 mationBacktranslator]: Skipped ATE [13] [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[] [2019-04-26 16:10:01,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] [2019-04-26 16:10:01,631 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-04-26 16:10:01,632 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:10:01 BasicIcfg [2019-04-26 16:10:01,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-26 16:10:01,633 INFO L168 Benchmark]: Toolchain (without parser) took 1236.58 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 61.5 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,636 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-04-26 16:10:01,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 107.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,638 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 ms. Allocated memory is still 135.3 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,639 INFO L168 Benchmark]: RCFGBuilder took 334.91 ms. Allocated memory is still 135.3 MB. Free memory was 106.3 MB in the beginning and 95.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,641 INFO L168 Benchmark]: IcfgTransformer took 51.51 ms. Allocated memory is still 135.3 MB. Free memory was 95.8 MB in the beginning and 92.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,642 INFO L168 Benchmark]: TraceAbstraction took 776.76 ms. Allocated memory is still 135.3 MB. Free memory was 92.7 MB in the beginning and 61.5 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:01,650 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 135.3 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 107.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.01 ms. Allocated memory is still 135.3 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.91 ms. Allocated memory is still 135.3 MB. Free memory was 106.3 MB in the beginning and 95.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * IcfgTransformer took 51.51 ms. Allocated memory is still 135.3 MB. Free memory was 95.8 MB in the beginning and 92.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 776.76 ms. Allocated memory is still 135.3 MB. Free memory was 92.7 MB in the beginning and 61.5 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 34]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of IdentityTransformer. Possible FailurePath: [L29] COND TRUE i < n [L30] a[i] := 0; [L31] i := i + 1; [L34] assert a[r] == 0; VAL [freshIdentifier1=0, i=1, j=0, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 0 SDslu, 4 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 3 NumberOfNonLiveVariables, 12 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...