java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:37:48,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:37:48,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:37:48,449 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:37:48,449 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:37:48,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:37:48,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:37:48,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:37:48,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:37:48,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:37:48,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:37:48,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:37:48,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:37:48,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:37:48,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:37:48,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:37:48,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:37:48,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:37:48,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:37:48,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:37:48,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:37:48,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:37:48,494 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:37:48,494 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:37:48,494 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:37:48,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:37:48,496 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:37:48,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:37:48,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:37:48,505 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:37:48,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:37:48,506 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:37:48,506 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:37:48,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:37:48,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:37:48,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:37:48,509 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-02-28 10:37:48,527 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:37:48,527 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:37:48,528 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:37:48,529 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:37:48,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:37:48,529 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:37:48,529 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:37:48,529 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:37:48,530 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:37:48,530 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:37:48,531 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:37:48,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:37:48,533 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:37:48,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:37:48,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:37:48,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:37:48,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:37:48,537 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:37:48,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:37:48,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:37:48,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:37:48,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:37:48,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:37:48,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:37:48,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:37:48,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:37:48,540 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:37:48,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:37:48,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:37:48,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:37:48,540 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:37:48,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:37:48,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:37:48,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:37:48,609 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:37:48,609 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:37:48,610 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl [2019-02-28 10:37:48,610 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-02-28 10:37:48,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:37:48,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:37:48,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:37:48,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:37:48,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:37:48,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:37:48,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:37:48,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:37:48,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:37:48,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:37:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:37:49,029 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:37:49,029 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-28 10:37:49,031 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:49 BoogieIcfgContainer [2019-02-28 10:37:49,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:37:49,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:37:49,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:37:49,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:37:49,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/2) ... [2019-02-28 10:37:49,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be20901 and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:37:49, skipping insertion in model container [2019-02-28 10:37:49,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:49" (2/2) ... [2019-02-28 10:37:49,039 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bpl [2019-02-28 10:37:49,051 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:37:49,061 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:37:49,079 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:37:49,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:37:49,106 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:37:49,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:37:49,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:37:49,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:37:49,107 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:37:49,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:37:49,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:37:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:37:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:37:49,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:37:49,129 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,137 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 10:37:49,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:37:49,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:37:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:37:49,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:37:49,337 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 10:37:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,405 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 10:37:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:37:49,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:37:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,423 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:37:49,423 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 10:37:49,428 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-02-28 10:37:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 10:37:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 10:37:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 10:37:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 10:37:49,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 10:37:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,472 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 10:37:49,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:37:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 10:37:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:37:49,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:37:49,474 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-28 10:37:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:49,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:49,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:37:49,643 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 10:37:49,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:37:49,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:37:49,778 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-28 10:37:51,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:37:51,158 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 3 different actions 13 times. Widened at 1 different actions 3 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:37:51,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:51,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:37:51,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:51,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:51,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:51,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:37:51,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:51,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:37:51,383 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2019-02-28 10:37:51,384 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,410 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:37:51,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2019-02-28 10:37:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:51,441 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:51,477 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 10:37:51,543 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2019-02-28 10:37:51,546 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,598 INFO L315 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,623 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:51,696 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 10:37:51,707 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:37:51,711 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-02-28 10:37:51,846 INFO L315 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,142 INFO L169 IndexEqualityManager]: detected equality via solver [2019-02-28 10:37:52,154 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2019-02-28 10:37:52,157 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,158 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,176 INFO L315 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,182 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:37:52,182 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:39, output treesize:3 [2019-02-28 10:37:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:52,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:52,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-02-28 10:37:52,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:52,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:37:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:37:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:52,212 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-28 10:37:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:52,231 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 10:37:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:37:52,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:37:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:52,232 INFO L225 Difference]: With dead ends: 5 [2019-02-28 10:37:52,232 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:37:52,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:37:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:37:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:37:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:37:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:37:52,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-28 10:37:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:52,236 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:37:52,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:37:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:37:52,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:37:52,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:37:52,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 56) no Hoare annotation was computed. [2019-02-28 10:37:52,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 56) no Hoare annotation was computed. [2019-02-28 10:37:52,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 56) no Hoare annotation was computed. [2019-02-28 10:37:52,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 55) no Hoare annotation was computed. [2019-02-28 10:37:52,296 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 54) the Hoare annotation is: false [2019-02-28 10:37:52,296 INFO L444 ceAbstractionStarter]: At program point L53(lines 26 53) the Hoare annotation is: (or (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))) [2019-02-28 10:37:52,305 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:37:52 BoogieIcfgContainer [2019-02-28 10:37:52,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:37:52,306 INFO L168 Benchmark]: Toolchain (without parser) took 3655.67 ms. Allocated memory was 133.2 MB in the beginning and 260.6 MB in the end (delta: 127.4 MB). Free memory was 106.0 MB in the beginning and 114.0 MB in the end (delta: -8.0 MB). Peak memory consumption was 119.4 MB. Max. memory is 7.1 GB. [2019-02-28 10:37:52,308 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:37:52,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.14 ms. Allocated memory is still 133.2 MB. Free memory was 105.8 MB in the beginning and 104.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:37:52,310 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 ms. Allocated memory is still 133.2 MB. Free memory was 104.2 MB in the beginning and 103.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:37:52,311 INFO L168 Benchmark]: RCFGBuilder took 317.76 ms. Allocated memory is still 133.2 MB. Free memory was 103.0 MB in the beginning and 93.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:37:52,312 INFO L168 Benchmark]: TraceAbstraction took 3274.06 ms. Allocated memory was 133.2 MB in the beginning and 260.6 MB in the end (delta: 127.4 MB). Free memory was 93.5 MB in the beginning and 114.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:37:52,317 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.19 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.14 ms. Allocated memory is still 133.2 MB. Free memory was 105.8 MB in the beginning and 104.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.13 ms. Allocated memory is still 133.2 MB. Free memory was 104.2 MB in the beginning and 103.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 317.76 ms. Allocated memory is still 133.2 MB. Free memory was 103.0 MB in the beginning and 93.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3274.06 ms. Allocated memory was 133.2 MB in the beginning and 260.6 MB in the end (delta: 127.4 MB). Free memory was 93.5 MB in the beginning and 114.0 MB in the end (delta: -20.5 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main_~v~5[0] <= main_~v~5[1] || (1 <= main_~j~5 && main_~j~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...