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-48de6b2 [2019-04-26 16:10:05,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-04-26 16:10:05,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-04-26 16:10:05,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-04-26 16:10:05,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-04-26 16:10:05,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-04-26 16:10:05,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-04-26 16:10:05,782 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-04-26 16:10:05,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-04-26 16:10:05,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-04-26 16:10:05,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-04-26 16:10:05,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-04-26 16:10:05,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-04-26 16:10:05,788 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-04-26 16:10:05,789 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-04-26 16:10:05,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-04-26 16:10:05,790 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-04-26 16:10:05,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-04-26 16:10:05,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-04-26 16:10:05,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-04-26 16:10:05,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-04-26 16:10:05,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-04-26 16:10:05,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-04-26 16:10:05,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-04-26 16:10:05,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-04-26 16:10:05,813 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-04-26 16:10:05,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-04-26 16:10:05,818 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-04-26 16:10:05,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-04-26 16:10:05,819 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-04-26 16:10:05,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-04-26 16:10:05,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-04-26 16:10:05,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-04-26 16:10:05,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-04-26 16:10:05,822 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-04-26 16:10:05,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-04-26 16:10:05,823 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-04-26 16:10:05,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-04-26 16:10:05,824 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:05,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-04-26 16:10:05,864 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-04-26 16:10:05,868 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-04-26 16:10:05,869 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-04-26 16:10:05,870 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-04-26 16:10:05,870 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl [2019-04-26 16:10:05,871 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ValueTerminatedArrayIteration01.bpl' [2019-04-26 16:10:05,901 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-04-26 16:10:05,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-04-26 16:10:05,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-04-26 16:10:05,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-04-26 16:10:05,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-04-26 16:10:05,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,936 WARN L165 Inliner]: Program contained no entry procedure! [2019-04-26 16:10:05,937 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-04-26 16:10:05,937 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-04-26 16:10:05,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-04-26 16:10:05,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-04-26 16:10:05,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-04-26 16:10:05,940 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-04-26 16:10:05,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... [2019-04-26 16:10:05,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-04-26 16:10:05,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-04-26 16:10:05,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-04-26 16:10:05,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-04-26 16:10:05,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-04-26 16:10:06,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-04-26 16:10:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-04-26 16:10:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-04-26 16:10:06,430 INFO L278 CfgBuilder]: Using library mode [2019-04-26 16:10:06,431 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-04-26 16:10:06,432 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:06 BoogieIcfgContainer [2019-04-26 16:10:06,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-04-26 16:10:06,433 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-04-26 16:10:06,433 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-04-26 16:10:06,434 INFO L276 PluginConnector]: IcfgTransformer initialized [2019-04-26 16:10:06,437 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:06" (1/1) ... [2019-04-26 16:10:06,463 INFO L359 onniauxMapEliminator]: mainENTRY [2019-04-26 16:10:06,463 INFO L360 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-04-26 16:10:06,464 INFO L361 onniauxMapEliminator]: Out Formula: (and (= v_i_1 0) (= v_end_1 v_a_idx_0_term_1) (<= 0 v_end_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} OutVars{i=v_i_1, end=v_end_1, a_val_0=v_a_val_0_out_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_idx_0, i, a_val_0] [2019-04-26 16:10:06,464 INFO L362 onniauxMapEliminator]: L17-1 [2019-04-26 16:10:06,466 INFO L359 onniauxMapEliminator]: L17-1 [2019-04-26 16:10:06,466 INFO L360 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-04-26 16:10:06,467 INFO L361 onniauxMapEliminator]: Out Formula: (and (or (= v_i_3 v_a_idx_0_term_2) (= v_a_idx_0_term_2 v_a_idx_0_term_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)))) InVars {i=v_i_3, a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_1} OutVars{i=v_i_2, a_val_0=v_a_val_0_in_2, a_idx_0=v_a_idx_0_term_2} AuxVars[v_v_a_3_aux_1] AssignedVars[a_idx_0, i] [2019-04-26 16:10:06,467 INFO L362 onniauxMapEliminator]: L17-1 [2019-04-26 16:10:06,468 INFO L359 onniauxMapEliminator]: L17-1 [2019-04-26 16:10:06,469 INFO L360 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-04-26 16:10:06,469 INFO L361 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))) (= 42 v_v_a_4_aux_1) (or (= v_a_idx_0_term_3 v_a_idx_0_term_2) (= v_i_4 v_a_idx_0_term_3))) InVars {i=v_i_4, a_val_0=v_a_val_0_in_3, a_idx_0=v_a_idx_0_term_2} OutVars{i=v_i_4, a_val_0=v_a_val_0_in_3, a_idx_0=v_a_idx_0_term_3} AuxVars[v_v_a_4_aux_1] AssignedVars[a_idx_0] [2019-04-26 16:10:06,469 INFO L362 onniauxMapEliminator]: L20 [2019-04-26 16:10:06,481 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:10:06 BasicIcfg [2019-04-26 16:10:06,482 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-04-26 16:10:06,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-04-26 16:10:06,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-04-26 16:10:06,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-04-26 16:10:06,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:10:05" (1/3) ... [2019-04-26 16:10:06,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4881e20 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.04 04:10:06, skipping insertion in model container [2019-04-26 16:10:06,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:10:06" (2/3) ... [2019-04-26 16:10:06,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4881e20 and model type ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:10:06, skipping insertion in model container [2019-04-26 16:10:06,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 26.04 04:10:06" (3/3) ... [2019-04-26 16:10:06,491 INFO L112 eAbstractionObserver]: Analyzing ICFG ValueTerminatedArrayIteration01.bplME [2019-04-26 16:10:06,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-04-26 16:10:06,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-04-26 16:10:06,529 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-04-26 16:10:06,551 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-04-26 16:10:06,552 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-04-26 16:10:06,552 INFO L383 AbstractCegarLoop]: Hoare is false [2019-04-26 16:10:06,552 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-04-26 16:10:06,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-04-26 16:10:06,552 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-04-26 16:10:06,552 INFO L387 AbstractCegarLoop]: Difference is false [2019-04-26 16:10:06,552 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-04-26 16:10:06,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-04-26 16:10:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-04-26 16:10:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-04-26 16:10:06,573 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:10:06,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-04-26 16:10:06,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:10:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:10:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash 40779, now seen corresponding path program 1 times [2019-04-26 16:10:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:10:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:06,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-04-26 16:10:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-04-26 16:10:06,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-04-26 16:10:06,879 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 (= v_i_1 0) .cse0 (<= 0 v_end_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} OutVars{i=v_i_1, end=v_end_1, a_val_0=v_a_val_0_out_1, a_idx_0=v_a_idx_0_term_1} AuxVars[] AssignedVars[a_idx_0, i, a_val_0] {13#(and (<= i 0) (<= 0 end))} is VALID [2019-04-26 16:10:06,885 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)) (= 42 v_v_a_4_aux_1) (or (= v_a_idx_0_term_3 v_a_idx_0_term_2) .cse0))) InVars {i=v_i_4, a_val_0=v_a_val_0_in_3, a_idx_0=v_a_idx_0_term_2} OutVars{i=v_i_4, a_val_0=v_a_val_0_in_3, a_idx_0=v_a_idx_0_term_3} AuxVars[v_v_a_4_aux_1] AssignedVars[a_idx_0] {13#(and (<= i 0) (<= 0 end))} is VALID [2019-04-26 16:10:06,887 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-04-26 16:10:06,889 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:06,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-04-26 16:10:06,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-04-26 16:10:06,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:10:06,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-04-26 16:10:06,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-04-26 16:10:06,920 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:06,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-04-26 16:10:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-04-26 16:10:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-04-26 16:10:06,931 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-04-26 16:10:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:07,033 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-04-26 16:10:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-04-26 16:10:07,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-04-26 16:10:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-04-26 16:10:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:10:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-04-26 16:10:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-04-26 16:10:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-04-26 16:10:07,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-04-26 16:10:07,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-04-26 16:10:07,109 INFO L225 Difference]: With dead ends: 8 [2019-04-26 16:10:07,109 INFO L226 Difference]: Without dead ends: 5 [2019-04-26 16:10:07,111 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:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-04-26 16:10:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-04-26 16:10:07,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-04-26 16:10:07,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:07,139 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:07,139 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:07,141 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:10:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:07,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:07,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:07,142 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:07,142 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-04-26 16:10:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-04-26 16:10:07,144 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-04-26 16:10:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:07,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-04-26 16:10:07,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-04-26 16:10:07,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-04-26 16:10:07,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-04-26 16:10:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-04-26 16:10:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-04-26 16:10:07,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-04-26 16:10:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-04-26 16:10:07,149 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-04-26 16:10:07,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-04-26 16:10:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-04-26 16:10:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-04-26 16:10:07,150 INFO L394 BasicCegarLoop]: Found error trace [2019-04-26 16:10:07,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-04-26 16:10:07,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-04-26 16:10:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-04-26 16:10:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1263171, now seen corresponding path program 1 times [2019-04-26 16:10:07,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-04-26 16:10:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:10:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-04-26 16:10:07,224 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-04-26 16:10:07,229 INFO L85 mationBacktranslator]: Skipped ATE [14] [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[] [2019-04-26 16:10:07,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier1,QUANTIFIED] [2019-04-26 16:10:07,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] [2019-04-26 16:10:07,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] [2019-04-26 16:10:07,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] [2019-04-26 16:10:07,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier5,QUANTIFIED] [2019-04-26 16:10:07,243 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-04-26 16:10:07,245 INFO L202 PluginConnector]: Adding new model ValueTerminatedArrayIteration01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.04 04:10:07 BasicIcfg [2019-04-26 16:10:07,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-04-26 16:10:07,245 INFO L168 Benchmark]: Toolchain (without parser) took 1343.94 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 63.3 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:07,247 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-04-26 16:10:07,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.09 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:07,249 INFO L168 Benchmark]: Boogie Preprocessor took 21.76 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.0 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:07,250 INFO L168 Benchmark]: RCFGBuilder took 470.59 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 97.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:07,251 INFO L168 Benchmark]: IcfgTransformer took 49.06 ms. Allocated memory is still 134.7 MB. Free memory was 97.4 MB in the beginning and 94.6 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:07,252 INFO L168 Benchmark]: TraceAbstraction took 761.63 ms. Allocated memory is still 134.7 MB. Free memory was 94.4 MB in the beginning and 63.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-04-26 16:10:07,258 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.18 ms. Allocated memory is still 134.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.09 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.76 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.59 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 97.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * IcfgTransformer took 49.06 ms. Allocated memory is still 134.7 MB. Free memory was 97.4 MB in the beginning and 94.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 761.63 ms. Allocated memory is still 134.7 MB. Free memory was 94.4 MB in the beginning and 63.3 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 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] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[freshIdentifier5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of IdentityTransformer. Possible FailurePath: [L14] assume end >= 0; [L15] a[end] := 42; [L16] i := 0; VAL [end=0, freshIdentifier1=0, i=0] [L17] COND TRUE a[i] != 42 [L18] i := i + 1; VAL [end=0, freshIdentifier2=0, freshIdentifier3=43, i=1] [L17] COND FALSE !(a[i] != 42) VAL [end=0, freshIdentifier4=0, freshIdentifier5=43, i=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: 1 SDtfs, 1 SDslu, 1 SDs, 0 SdLazy, 8 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, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13 ConjunctsInSsa, 3 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...