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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:55:59,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:55:59,949 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:55:59,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:55:59,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:55:59,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:55:59,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:55:59,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:55:59,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:55:59,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:55:59,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:55:59,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:55:59,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:55:59,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:55:59,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:55:59,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:55:59,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:55:59,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:55:59,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:55:59,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:55:59,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:55:59,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:55:59,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:55:59,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:55:59,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:55:59,985 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:55:59,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:55:59,987 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:55:59,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:55:59,988 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:55:59,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:55:59,990 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:55:59,991 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:55:59,991 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:55:59,992 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:55:59,992 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:55:59,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:55:59,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:55:59,994 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:00,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:56:00,041 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:56:00,045 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:56:00,046 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:56:00,047 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:56:00,048 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-05-15 10:56:00,048 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-05-15 10:56:00,089 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:56:00,091 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:56:00,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:56:00,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:56:00,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,129 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:56:00,129 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:56:00,130 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:56:00,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:56:00,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:56:00,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:56:00,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:56:00,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:56:00,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:56:00,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:56:00,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56: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-05-15 10:56:00,243 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-05-15 10:56:00,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-05-15 10:56:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-05-15 10:56:00,499 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:56:00,500 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-05-15 10:56:00,501 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00 BoogieIcfgContainer [2019-05-15 10:56:00,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:56:00,502 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:56:00,502 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:56:00,503 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:56:00,507 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (1/1) ... [2019-05-15 10:56:00,566 INFO L632 onniauxMapEliminator]: mainENTRY [2019-05-15 10:56:00,567 INFO L633 onniauxMapEliminator]: In Formula: (and (= v_main_i_1 0) (= v_main_a_1 (store v_main_a_2 (* 4 v_main_n_1) 23)) (<= 0 v_main_n_1)) InVars {main_a=v_main_a_2, main_n=v_main_n_1} OutVars{main_a=v_main_a_1, main_n=v_main_n_1, main_i=v_main_i_1} AuxVars[] AssignedVars[main_a, main_i] [2019-05-15 10:56:00,568 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not v_main_a_idx_0_term_assigned_1) (= (* 4 v_main_n_1) v_main_a_idx_0_term_1)) (= v_main_a_val_0_in_1 v_main_a_val_0_out_1) (= v_main_i_1 0) v_main_a_idx_0_term_assigned_1 (<= 0 v_main_n_1) (or (= v_main_a_val_0_in_1 23) (not (= (* 4 v_main_n_1) v_main_a_idx_0_term_1)))) InVars {main_a_val_0=v_main_a_val_0_in_1, main_n=v_main_n_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} OutVars{main_i=v_main_i_1, main_a_val_0=v_main_a_val_0_out_1, main_n=v_main_n_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} AuxVars[] AssignedVars[main_a_val_0, main_i] [2019-05-15 10:56:00,568 INFO L635 onniauxMapEliminator]: L26-1 [2019-05-15 10:56:00,598 INFO L632 onniauxMapEliminator]: L26-1 [2019-05-15 10:56:00,598 INFO L633 onniauxMapEliminator]: In Formula: (and (not (= 23 (select v_main_a_3 v_main_i_3))) (= v_main_i_2 (+ v_main_i_3 4))) InVars {main_a=v_main_a_3, main_i=v_main_i_3} OutVars{main_a=v_main_a_3, main_i=v_main_i_2} AuxVars[] AssignedVars[main_i] [2019-05-15 10:56:00,599 INFO L634 onniauxMapEliminator]: Out Formula: (and v_main_a_idx_0_term_assigned_1 (not (= 23 v_v_main_a_3_aux_1)) (or (= v_main_i_3 v_main_a_idx_0_term_2) (not v_main_a_idx_0_term_assigned_1)) (= v_main_i_2 (+ v_main_i_3 4)) (or (not (= v_main_i_3 v_main_a_idx_0_term_2)) (= v_main_a_val_0_in_2 v_v_main_a_3_aux_1))) InVars {main_i=v_main_i_3, main_a_val_0=v_main_a_val_0_in_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} OutVars{main_i=v_main_i_2, main_a_val_0=v_main_a_val_0_in_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} AuxVars[v_v_main_a_3_aux_1] AssignedVars[main_i] [2019-05-15 10:56:00,599 INFO L635 onniauxMapEliminator]: L30 [2019-05-15 10:56:00,611 INFO L632 onniauxMapEliminator]: L26-1 [2019-05-15 10:56:00,611 INFO L633 onniauxMapEliminator]: In Formula: (= (select v_main_a_5 v_main_i_7) 23) InVars {main_a=v_main_a_5, main_i=v_main_i_7} OutVars{main_a=v_main_a_5, main_i=v_main_i_7} AuxVars[] AssignedVars[] [2019-05-15 10:56:00,612 INFO L634 onniauxMapEliminator]: Out Formula: (and (or (not v_main_a_idx_0_term_assigned_1) (= v_main_i_7 v_main_a_idx_0_term_3)) v_main_a_idx_0_term_assigned_1 (or (= v_v_main_a_5_aux_1 v_main_a_val_0_in_3) (not (= v_main_i_7 v_main_a_idx_0_term_3))) (= v_v_main_a_5_aux_1 23)) InVars {main_i=v_main_i_7, main_a_val_0=v_main_a_val_0_in_3, main_a_idx_0=v_main_a_idx_0_term_3, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} OutVars{main_i=v_main_i_7, main_a_val_0=v_main_a_val_0_in_3, main_a_idx_0=v_main_a_idx_0_term_3, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} AuxVars[v_v_main_a_5_aux_1] AssignedVars[] [2019-05-15 10:56:00,612 INFO L635 onniauxMapEliminator]: mainEXIT [2019-05-15 10:56:00,658 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00 BasicIcfg [2019-05-15 10:56:00,659 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:56:00,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:56:00,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:56:00,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:56:00,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:56:00" (1/3) ... [2019-05-15 10:56:00,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161b2c8c and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:56:00" (2/3) ... [2019-05-15 10:56:00,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161b2c8c and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:00, skipping insertion in model container [2019-05-15 10:56:00,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:56:00" (3/3) ... [2019-05-15 10:56:00,671 INFO L109 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bplME [2019-05-15 10:56:00,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:56:00,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:56:00,717 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:56:00,751 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:56:00,752 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:56:00,752 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:56:00,752 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:56:00,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:56:00,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:56:00,753 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:56:00,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:56:00,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:56:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-05-15 10:56:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-05-15 10:56:00,778 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:56:00,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-05-15 10:56:00,782 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:56:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:56:00,789 INFO L82 PathProgramCache]: Analyzing trace with hash 40748, now seen corresponding path program 1 times [2019-05-15 10:56:00,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:56:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:00,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:56:00,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:56:01,197 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} [11] mainENTRY-->L26-1: Formula: (let ((.cse0 (= (* 4 v_main_n_1) v_main_a_idx_0_term_1))) (and (or (not v_main_a_idx_0_term_assigned_1) .cse0) (= v_main_a_val_0_in_1 v_main_a_val_0_out_1) (= v_main_i_1 0) v_main_a_idx_0_term_assigned_1 (<= 0 v_main_n_1) (or (= v_main_a_val_0_in_1 23) (not .cse0)))) InVars {main_a_val_0=v_main_a_val_0_in_1, main_n=v_main_n_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} OutVars{main_i=v_main_i_1, main_a_val_0=v_main_a_val_0_out_1, main_n=v_main_n_1, main_a_idx_0=v_main_a_idx_0_term_1, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} AuxVars[] AssignedVars[main_a_val_0, main_i] {13#(and main_a_idx_0_bool (= main_a_val_0 23) (exists ((main_n Int)) (= main_a_idx_0 (* 4 main_n))))} is VALID [2019-05-15 10:56:01,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and main_a_idx_0_bool (= main_a_val_0 23) (exists ((main_n Int)) (= main_a_idx_0 (* 4 main_n))))} [12] L26-1-->L30: Formula: (let ((.cse0 (= v_main_i_3 v_main_a_idx_0_term_2))) (and v_main_a_idx_0_term_assigned_1 (not (= 23 v_v_main_a_3_aux_1)) (or .cse0 (not v_main_a_idx_0_term_assigned_1)) (= v_main_i_2 (+ v_main_i_3 4)) (or (not .cse0) (= v_main_a_val_0_in_2 v_v_main_a_3_aux_1)))) InVars {main_i=v_main_i_3, main_a_val_0=v_main_a_val_0_in_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} OutVars{main_i=v_main_i_2, main_a_val_0=v_main_a_val_0_in_2, main_a_idx_0=v_main_a_idx_0_term_2, main_a_idx_0_bool=v_main_a_idx_0_term_assigned_1} AuxVars[v_v_main_a_3_aux_1] AssignedVars[main_i] {9#false} is VALID [2019-05-15 10:56:01,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} [14] L30-->mainErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_main_i_4 (* 4 v_main_n_2))) InVars {main_n=v_main_n_2, main_i=v_main_i_4} OutVars{main_n=v_main_n_2, main_i=v_main_i_4} AuxVars[] AssignedVars[] {9#false} is VALID [2019-05-15 10:56:01,215 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:01,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:56:01,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:56:01,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:56:01,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:56:01,247 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:01,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:56:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:56:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:56:01,260 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-05-15 10:56:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,346 INFO L93 Difference]: Finished difference Result 3 states and 2 transitions. [2019-05-15 10:56:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:56:01,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-15 10:56:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:56:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-05-15 10:56:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:56:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-05-15 10:56:01,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3 transitions. [2019-05-15 10:56:01,399 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:01,407 INFO L225 Difference]: With dead ends: 3 [2019-05-15 10:56:01,407 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:56:01,410 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:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:56:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:56:01,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:56:01,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,433 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,433 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,434 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,435 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,435 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:56:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:56:01,436 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:56:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:56:01,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:56:01,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:56:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:56:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:56:01,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-05-15 10:56:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:56:01,440 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:56:01,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:56:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:56:01,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:56:01,443 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:56:01,445 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:56:01 BasicIcfg [2019-05-15 10:56:01,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:56:01,447 INFO L168 Benchmark]: Toolchain (without parser) took 1357.01 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 66.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,449 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:56:01,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,451 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,452 INFO L168 Benchmark]: RCFGBuilder took 337.33 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 96.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,454 INFO L168 Benchmark]: IcfgTransformer took 156.82 ms. Allocated memory is still 133.7 MB. Free memory was 96.7 MB in the beginning and 93.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,455 INFO L168 Benchmark]: TraceAbstraction took 784.94 ms. Allocated memory is still 133.7 MB. Free memory was 92.6 MB in the beginning and 66.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:56:01,461 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 133.7 MB. Free memory is still 111.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.33 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 96.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * IcfgTransformer took 156.82 ms. Allocated memory is still 133.7 MB. Free memory was 96.7 MB in the beginning and 93.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 784.94 ms. Allocated memory is still 133.7 MB. Free memory was 92.6 MB in the beginning and 66.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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.7s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 1 SDslu, 1 SDs, 0 SdLazy, 2 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.0s 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, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 2 ConstructedInterpolants, 1 QuantifiedInterpolants, 24 SizeOfPredicates, 4 NumberOfNonLiveVariables, 17 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...