java -ea -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/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:57:27,261 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:57:27,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:57:27,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:57:27,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:57:27,276 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:57:27,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:57:27,279 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:57:27,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:57:27,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:57:27,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:57:27,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:57:27,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:57:27,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:57:27,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:57:27,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:57:27,289 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:57:27,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:57:27,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:57:27,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:57:27,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:57:27,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:57:27,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:57:27,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:57:27,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:57:27,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:57:27,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:57:27,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:57:27,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:57:27,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:57:27,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:57:27,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:57:27,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:57:27,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:57:27,309 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:57:27,310 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:57:27,310 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-01-31 14:57:27,323 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:57:27,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:57:27,325 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:57:27,325 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:57:27,325 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:57:27,325 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:57:27,326 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:57:27,326 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:57:27,326 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:57:27,326 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 14:57:27,327 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 14:57:27,327 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:57:27,327 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:57:27,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:57:27,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:57:27,328 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:57:27,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:57:27,329 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:57:27,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:57:27,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:57:27,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:57:27,329 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:57:27,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:57:27,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:57:27,330 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:57:27,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:57:27,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:57:27,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:57:27,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:57:27,331 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:57:27,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:57:27,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:57:27,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:57:27,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:57:27,332 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:57:27,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:57:27,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:57:27,333 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:57:27,333 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:57:27,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:57:27,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:57:27,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:57:27,380 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:57:27,381 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:57:27,381 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2019-01-31 14:57:27,382 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2019-01-31 14:57:27,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:57:27,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:57:27,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:57:27,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:57:27,439 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:57:27,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:57:27,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:57:27,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:57:27,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:57:27,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/1) ... [2019-01-31 14:57:27,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:57:27,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:57:27,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:57:27,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:57:27,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:57:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:57:27,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:57:28,042 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:57:28,043 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-31 14:57:28,044 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:57:28 BoogieIcfgContainer [2019-01-31 14:57:28,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:57:28,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:57:28,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:57:28,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:57:28,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:57:27" (1/2) ... [2019-01-31 14:57:28,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d233f9 and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:57:28, skipping insertion in model container [2019-01-31 14:57:28,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:57:28" (2/2) ... [2019-01-31 14:57:28,052 INFO L112 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl [2019-01-31 14:57:28,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:57:28,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:57:28,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:57:28,150 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:57:28,150 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:57:28,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:57:28,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:57:28,151 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:57:28,151 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:57:28,151 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:57:28,152 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:57:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-31 14:57:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:57:28,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:57:28,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:57:28,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:57:28,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:57:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 14:57:28,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:57:28,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:57:28,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:57:28,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:57:28,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:57:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:57:28,401 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {12#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-31 14:57:28,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= ULTIMATE.start_main_~i~5 0)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {11#false} is VALID [2019-01-31 14:57:28,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-01-31 14:57:28,408 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-01-31 14:57:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:57:28,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:57:28,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:57:28,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:57:28,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:57:28,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:57:28,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:57:28,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:57:28,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:57:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:57:28,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:57:28,473 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-31 14:57:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:57:28,630 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 14:57:28,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:57:28,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:57:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:57:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:57:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 14:57:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:57:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 14:57:28,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-31 14:57:28,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:57:28,775 INFO L225 Difference]: With dead ends: 12 [2019-01-31 14:57:28,776 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:57:28,779 INFO L631 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-01-31 14:57:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:57:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:57:28,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:57:28,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:57:28,812 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:57:28,812 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:57:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:57:28,815 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-31 14:57:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:57:28,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:57:28,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:57:28,816 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:57:28,816 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:57:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:57:28,818 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-31 14:57:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:57:28,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:57:28,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:57:28,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:57:28,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:57:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:57:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-31 14:57:28,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-31 14:57:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:57:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-31 14:57:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:57:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-31 14:57:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 14:57:28,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:57:28,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 14:57:28,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:57:28,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:57:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-31 14:57:28,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:57:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:57:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:57:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:57:28,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:57:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:57:28,973 INFO L273 TraceCheckUtils]: 0: Hoare triple {60#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {62#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-31 14:57:28,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {63#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-31 14:57:28,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(<= ULTIMATE.start_main_~i~5 1)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {61#false} is VALID [2019-01-31 14:57:28,976 INFO L273 TraceCheckUtils]: 3: Hoare triple {61#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {61#false} is VALID [2019-01-31 14:57:28,977 INFO L273 TraceCheckUtils]: 4: Hoare triple {61#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {61#false} is VALID [2019-01-31 14:57:28,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2019-01-31 14:57:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 14:57:28,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:57:28,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:57:28,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 14:57:28,981 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-31 14:57:29,041 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 14:57:29,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:58:36,218 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.Boogie2SmtSymbolTableTmpVars.getBoogieVar(Boogie2SmtSymbolTableTmpVars.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.ExpressionTransformer.toAffineExpr(ExpressionTransformer.java:167) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.ExpressionTransformer.affineExprCached(ExpressionTransformer.java:99) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processNumericAssignWithoutIfs(OctStatementProcessor.java:200) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processNumericAssign(OctStatementProcessor.java:192) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processSingleAssignment(OctStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processAssignmentStatement(OctStatementProcessor.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctStatementProcessor.processStatement(OctStatementProcessor.java:65) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:204) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.relational.octagon.OctPostOperator.apply(OctPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleStatementBySubdomain(ArrayDomainToolkit.java:165) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processSingleAssignment(ArrayDomainStatementProcessor.java:136) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssignment(ArrayDomainStatementProcessor.java:76) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:43) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:124) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:74) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-31 14:58:36,222 INFO L168 Benchmark]: Toolchain (without parser) took 68786.13 ms. Allocated memory was 140.5 MB in the beginning and 831.0 MB in the end (delta: 690.5 MB). Free memory was 107.8 MB in the beginning and 113.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 684.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:58:36,224 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:58:36,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.13 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:58:36,226 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 140.5 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:58:36,227 INFO L168 Benchmark]: RCFGBuilder took 529.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.7 MB in the beginning and 92.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:58:36,228 INFO L168 Benchmark]: TraceAbstraction took 68175.88 ms. Allocated memory was 140.5 MB in the beginning and 831.0 MB in the end (delta: 690.5 MB). Free memory was 91.8 MB in the beginning and 113.4 MB in the end (delta: -21.5 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:58:36,233 INFO L336 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.21 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.13 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.75 ms. Allocated memory is still 140.5 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.7 MB in the beginning and 92.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68175.88 ms. Allocated memory was 140.5 MB in the beginning and 831.0 MB in the end (delta: 690.5 MB). Free memory was 91.8 MB in the beginning and 113.4 MB in the end (delta: -21.5 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...