java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:52:55,941 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:52:55,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:52:55,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:52:55,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:52:55,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:52:55,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:52:55,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:52:55,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:52:55,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:52:55,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:52:55,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:52:55,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:52:55,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:52:55,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:52:55,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:52:55,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:52:55,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:52:55,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:52:55,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:52:55,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:52:55,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:52:55,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:52:55,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:52:55,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:52:55,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:52:55,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:52:55,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:52:55,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:52:55,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:52:55,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:52:55,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:52:55,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:52:55,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:52:55,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:52:55,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:52:55,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-03-04 16:52:56,017 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:52:56,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:52:56,019 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:52:56,019 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:52:56,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:52:56,019 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:52:56,020 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:52:56,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:52:56,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:52:56,023 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:52:56,023 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:52:56,023 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:52:56,023 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:52:56,024 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:52:56,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:52:56,026 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:52:56,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:52:56,027 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:52:56,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:52:56,027 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:52:56,027 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:52:56,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:52:56,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:52:56,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:52:56,028 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:52:56,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:52:56,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:52:56,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:52:56,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:52:56,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:52:56,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:52:56,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:52:56,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:52:56,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:52:56,031 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:52:56,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:52:56,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:52:56,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:52:56,033 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:52:56,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:52:56,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:52:56,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:52:56,106 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:52:56,107 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:52:56,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl [2019-03-04 16:52:56,108 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl' [2019-03-04 16:52:56,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:52:56,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:52:56,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:52:56,155 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:52:56,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:52:56,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:52:56,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:52:56,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:52:56,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:52:56,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:52:56,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:52:56,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:52:56,532 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:52:56,532 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-03-04 16:52:56,534 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56 BoogieIcfgContainer [2019-03-04 16:52:56,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:52:56,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:52:56,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:52:56,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:52:56,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/2) ... [2019-03-04 16:52:56,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ea98e8 and model type sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:52:56, skipping insertion in model container [2019-03-04 16:52:56,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56" (2/2) ... [2019-03-04 16:52:56,544 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array.i_3.bpl [2019-03-04 16:52:56,556 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:52:56,565 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:52:56,580 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:52:56,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:52:56,612 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:52:56,612 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:52:56,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:52:56,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:52:56,612 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:52:56,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:52:56,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:52:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-03-04 16:52:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:52:56,634 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:56,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:52:56,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-03-04 16:52:56,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:56,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:52:56,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:52:56,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:52:56,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:52:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:52:56,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:52:56,971 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-03-04 16:52:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:57,178 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-03-04 16:52:57,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:52:57,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:52:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:57,193 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:52:57,193 INFO L226 Difference]: Without dead ends: 9 [2019-03-04 16:52:57,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:52:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-03-04 16:52:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-03-04 16:52:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:52:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-03-04 16:52:57,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2019-03-04 16:52:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:57,235 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-03-04 16:52:57,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:52:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-03-04 16:52:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:52:57,236 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:57,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:57,236 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 266557342, now seen corresponding path program 1 times [2019-03-04 16:52:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:57,842 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2019-03-04 16:52:57,973 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 5 [2019-03-04 16:52:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:52:57,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:57,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:52:58,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:52:58,002 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [19], [21], [23] [2019-03-04 16:52:58,063 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:52:58,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:52:58,134 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-03-04 16:53:02,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:53:02,716 INFO L272 AbstractInterpreter]: Visited 8 different actions 74 times. Merged at 3 different actions 33 times. Widened at 3 different actions 24 times. Found 36 fixpoints after 6 different actions. Largest state had 0 variables. [2019-03-04 16:53:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:02,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:53:02,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:02,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:53:02,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:02,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:02,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:53:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:02,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-03-04 16:53:02,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,044 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,045 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-03-04 16:53:03,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-03-04 16:53:03,130 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,203 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,203 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2019-03-04 16:53:03,269 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-03-04 16:53:03,270 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,287 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:53:03,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-03-04 16:53:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:03,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:03,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:53:03,343 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-03-04 16:53:03,536 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,601 INFO L309 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,607 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:53:03,608 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:5 [2019-03-04 16:53:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:53:03,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:03,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-03-04 16:53:03,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:03,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:53:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:53:03,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:03,643 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2019-03-04 16:53:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:03,820 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-03-04 16:53:03,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:53:03,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:53:03,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:03,822 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:53:03,822 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:53:03,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:53:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:53:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:53:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:53:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:53:03,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-03-04 16:53:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:03,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:53:03,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:53:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:53:03,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:53:03,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:53:03,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 92) no Hoare annotation was computed. [2019-03-04 16:53:03,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 92) no Hoare annotation was computed. [2019-03-04 16:53:03,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 92) no Hoare annotation was computed. [2019-03-04 16:53:03,955 INFO L444 ceAbstractionStarter]: At program point L89(lines 56 89) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6)) (= (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)) (select ULTIMATE.start_main_~C~6 0))) [2019-03-04 16:53:03,955 INFO L444 ceAbstractionStarter]: At program point L82(lines 82 90) the Hoare annotation is: false [2019-03-04 16:53:03,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 91) no Hoare annotation was computed. [2019-03-04 16:53:03,955 INFO L451 ceAbstractionStarter]: At program point L47(lines 28 47) the Hoare annotation is: true [2019-03-04 16:53:03,955 INFO L451 ceAbstractionStarter]: At program point L66(lines 37 66) the Hoare annotation is: true [2019-03-04 16:53:03,966 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:03 BoogieIcfgContainer [2019-03-04 16:53:03,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:53:03,966 INFO L168 Benchmark]: Toolchain (without parser) took 7813.11 ms. Allocated memory was 136.3 MB in the beginning and 416.3 MB in the end (delta: 280.0 MB). Free memory was 108.2 MB in the beginning and 365.9 MB in the end (delta: -257.7 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:03,968 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:53:03,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.28 ms. Allocated memory is still 136.3 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:03,970 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 136.3 MB. Free memory was 106.5 MB in the beginning and 105.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:03,970 INFO L168 Benchmark]: RCFGBuilder took 309.73 ms. Allocated memory is still 136.3 MB. Free memory was 105.3 MB in the beginning and 95.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:03,971 INFO L168 Benchmark]: TraceAbstraction took 7430.71 ms. Allocated memory was 136.3 MB in the beginning and 416.3 MB in the end (delta: 280.0 MB). Free memory was 94.8 MB in the beginning and 365.9 MB in the end (delta: -271.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:03,976 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.28 ms. Allocated memory is still 136.3 MB. Free memory was 108.2 MB in the beginning and 106.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.42 ms. Allocated memory is still 136.3 MB. Free memory was 106.5 MB in the beginning and 105.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.73 ms. Allocated memory is still 136.3 MB. Free memory was 105.3 MB in the beginning and 95.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7430.71 ms. Allocated memory was 136.3 MB in the beginning and 416.3 MB in the end (delta: 280.0 MB). Free memory was 94.8 MB in the beginning and 365.9 MB in the end (delta: -271.1 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main_~i~6 <= 0 && 0 <= main_~i~6) || main_~B~6[0] + main_~A~6[0] == main_~C~6[0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 7.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 3 SDs, 0 SdLazy, 30 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 22 HoareAnnotationTreeSize, 4 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 697 SizeOfPredicates, 7 NumberOfNonLiveVariables, 41 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...