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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:02:05,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:02:05,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:02:05,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:02:05,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:02:05,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:02:05,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:02:05,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:02:05,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:02:05,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:02:05,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:02:05,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:02:05,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:02:05,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:02:05,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:02:05,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:02:05,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:02:05,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:02:05,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:02:05,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:02:05,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:02:05,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:02:05,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:02:05,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:02:05,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:02:05,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:02:05,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:02:05,406 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:02:05,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:02:05,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:02:05,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:02:05,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:02:05,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:02:05,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:02:05,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:02:05,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:02:05,413 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:02:05,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:02:05,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:02:05,429 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:02:05,429 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:02:05,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:02:05,430 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:02:05,430 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:02:05,430 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:02:05,430 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:02:05,430 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:02:05,431 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:02:05,431 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:02:05,431 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:02:05,432 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:02:05,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:02:05,432 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:02:05,432 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:02:05,433 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:02:05,433 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:02:05,433 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:02:05,433 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:02:05,434 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:02:05,434 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:02:05,434 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:02:05,434 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:02:05,434 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:02:05,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:02:05,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:02:05,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:02:05,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:02:05,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:02:05,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:02:05,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:02:05,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:02:05,436 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:02:05,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:02:05,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:02:05,437 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:02:05,437 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:02:05,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:02:05,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:02:05,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:02:05,497 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:02:05,498 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:02:05,499 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl [2018-12-03 18:02:05,499 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl' [2018-12-03 18:02:05,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:02:05,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:02:05,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:02:05,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:02:05,545 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:02:05,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:02:05,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:02:05,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:02:05,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:02:05,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... [2018-12-03 18:02:05,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:02:05,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:02:05,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:02:05,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:02:05,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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 [2018-12-03 18:02:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:02:05,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:02:05,942 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:02:05,943 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:02:05,943 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:02:05 BoogieIcfgContainer [2018-12-03 18:02:05,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:02:05,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:02:05,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:02:05,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:02:05,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:02:05" (1/2) ... [2018-12-03 18:02:05,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670160a4 and model type sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:02:05, skipping insertion in model container [2018-12-03 18:02:05,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:02:05" (2/2) ... [2018-12-03 18:02:05,952 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_4.bpl [2018-12-03 18:02:05,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:02:05,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:02:05,986 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:02:06,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:02:06,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:02:06,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:02:06,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:02:06,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:02:06,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:02:06,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:02:06,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:02:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:02:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:02:06,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:06,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:02:06,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:06,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:02:06,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:06,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:06,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:06,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:06,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:06,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:06,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:06,242 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:02:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:06,357 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-12-03 18:02:06,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:06,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:02:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:06,370 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:02:06,370 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:02:06,373 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 [2018-12-03 18:02:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:02:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 18:02:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:02:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 18:02:06,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 3 [2018-12-03 18:02:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 18:02:06,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 18:02:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:02:06,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:06,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 18:02:06,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:06,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:06,414 INFO L82 PathProgramCache]: Analyzing trace with hash 894402864, now seen corresponding path program 1 times [2018-12-03 18:02:06,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:06,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:06,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:06,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:06,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:06,574 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 18:02:06,576 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14], [18] [2018-12-03 18:02:06,655 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:02:06,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:02:07,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:02:07,091 INFO L272 AbstractInterpreter]: Visited 5 different actions 40 times. Merged at 3 different actions 26 times. Widened at 3 different actions 14 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:02:07,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:07,147 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:02:07,201 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-03 18:02:07,201 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:02:07,273 INFO L418 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2018-12-03 18:02:07,273 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:02:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:02:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-03 18:02:07,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:07,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:02:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:02:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:02:07,277 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 18:02:07,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:07,481 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-03 18:02:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:02:07,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 18:02:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:07,482 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:02:07,482 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:02:07,483 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:02:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:02:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-03 18:02:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:02:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 18:02:07,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-12-03 18:02:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:07,496 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 18:02:07,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:02:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 18:02:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:02:07,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:07,498 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 18:02:07,498 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:07,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:07,499 INFO L82 PathProgramCache]: Analyzing trace with hash -819309919, now seen corresponding path program 1 times [2018-12-03 18:02:07,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:07,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:07,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:07,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:07,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:07,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:07,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:07,572 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 18:02:07,572 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [14], [16], [18] [2018-12-03 18:02:07,574 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:02:07,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:02:07,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:02:07,937 INFO L272 AbstractInterpreter]: Visited 7 different actions 71 times. Merged at 6 different actions 46 times. Widened at 5 different actions 25 times. Found 11 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:02:07,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:07,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:02:07,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:07,969 INFO L192 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 [2018-12-03 18:02:07,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:07,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:02:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:08,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:08,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:08,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:08,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2018-12-03 18:02:08,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:08,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:02:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:02:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:02:08,104 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-12-03 18:02:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:08,234 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-03 18:02:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:02:08,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-03 18:02:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:08,236 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:02:08,237 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:02:08,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:02:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:02:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-03 18:02:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:02:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 18:02:08,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2018-12-03 18:02:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:08,254 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 18:02:08,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:02:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 18:02:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:02:08,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:08,256 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 18:02:08,256 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:08,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1535588082, now seen corresponding path program 2 times [2018-12-03 18:02:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:08,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:08,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:08,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:08,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:08,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:08,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:08,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:08,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:02:08,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:02:08,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:02:08,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:08,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 18:02:08,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 18:02:08,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:08,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2018-12-03 18:02:08,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:02:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:02:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:08,769 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-12-03 18:02:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:08,923 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-12-03 18:02:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:02:08,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 18:02:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:08,927 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:02:08,927 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:02:08,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:02:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 18:02:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:02:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-03 18:02:08,937 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2018-12-03 18:02:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:08,937 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-03 18:02:08,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:02:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-03 18:02:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:02:08,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:08,943 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1] [2018-12-03 18:02:08,943 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:08,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1942894928, now seen corresponding path program 3 times [2018-12-03 18:02:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:08,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:08,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:08,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:08,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:09,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:09,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:09,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:09,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:02:09,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:09,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:09,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:02:09,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:02:09,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:02:09,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:09,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:09,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:09,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:09,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 10 [2018-12-03 18:02:09,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:09,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:02:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:02:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:09,221 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2018-12-03 18:02:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:09,598 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-12-03 18:02:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:02:09,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 18:02:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:09,604 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:02:09,604 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:02:09,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:09,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:02:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:02:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:02:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-03 18:02:09,624 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-12-03 18:02:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:09,624 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-03 18:02:09,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:02:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-12-03 18:02:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:02:09,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:09,629 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1] [2018-12-03 18:02:09,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:09,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash -466394431, now seen corresponding path program 4 times [2018-12-03 18:02:09,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:09,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:09,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:09,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:09,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 18:02:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 18:02:09,697 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 18:02:09,717 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:02:09 BoogieIcfgContainer [2018-12-03 18:02:09,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:02:09,718 INFO L168 Benchmark]: Toolchain (without parser) took 4175.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -604.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2018-12-03 18:02:09,720 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:09,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:09,722 INFO L168 Benchmark]: Boogie Preprocessor took 23.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:09,722 INFO L168 Benchmark]: RCFGBuilder took 330.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:02:09,723 INFO L168 Benchmark]: TraceAbstraction took 3772.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -625.6 MB). Peak memory consumption was 73.3 MB. Max. memory is 7.1 GB. [2018-12-03 18:02:09,727 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 330.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3772.36 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -625.6 MB). Peak memory consumption was 73.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~i~4, main_~sn~4; [L12] havoc main_~i~4; [L13] main_~sn~4 := 0; [L14] main_~i~4 := 1; VAL [main_~i~4=1, main_~sn~4=0] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=1, main_~sn~4=0] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; VAL [main_~i~4=1, main_~sn~4=2] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=2, main_~sn~4=2] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=2, main_~sn~4=2] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; VAL [main_~i~4=2, main_~sn~4=4] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=3, main_~sn~4=4] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=3, main_~sn~4=4] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; VAL [main_~i~4=3, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=4, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=4, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); VAL [main_~i~4=4, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=5, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=5, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); VAL [main_~i~4=5, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=6, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=6, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); VAL [main_~i~4=6, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=7, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=7, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); VAL [main_~i~4=7, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=8, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=8, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); VAL [main_~i~4=8, main_~sn~4=6] [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=9, main_~sn~4=6] [L22] assume !(main_~i~4 <= 8); [L23] __VERIFIER_assert_#in~cond := (if main_~sn~4 == 16 || main_~sn~4 == 0 then 1 else 0); [L24] havoc __VERIFIER_assert_~cond; [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L26] assume __VERIFIER_assert_~cond == 0; [L27] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] [L33] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. UNSAFE Result, 3.7s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 33 SDslu, 13 SDs, 0 SdLazy, 86 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9 AbsIntWeakeningRatio, 0.6 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 3627 SizeOfPredicates, 4 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 52/157 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...