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_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:01:56,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:01:56,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:01:56,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:01:56,557 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:01:56,558 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:01:56,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:01:56,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:01:56,568 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:01:56,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:01:56,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:01:56,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:01:56,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:01:56,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:01:56,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:01:56,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:01:56,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:01:56,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:01:56,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:01:56,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:01:56,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:01:56,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:01:56,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:01:56,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:01:56,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:01:56,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:01:56,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:01:56,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:01:56,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:01:56,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:01:56,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:01:56,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:01:56,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:01:56,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:01:56,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:01:56,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:01:56,605 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:01:56,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:01:56,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:01:56,619 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:01:56,619 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:01:56,620 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:01:56,620 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:01:56,620 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:01:56,620 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:01:56,621 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:01:56,621 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:01:56,621 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:01:56,621 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:01:56,621 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:01:56,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:01:56,622 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:01:56,622 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:01:56,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:01:56,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:01:56,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:01:56,623 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:01:56,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:01:56,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:01:56,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:01:56,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:01:56,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:01:56,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:01:56,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:01:56,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:01:56,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:01:56,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:01:56,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:56,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:01:56,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:01:56,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:01:56,626 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:01:56,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:01:56,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:01:56,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:01:56,627 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:01:56,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:01:56,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:01:56,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:01:56,681 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:01:56,681 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:01:56,682 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl [2018-12-03 18:01:56,682 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2018-12-03 18:01:56,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:01:56,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:01:56,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:56,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:01:56,724 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:01:56,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:56,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:01:56,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:01:56,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:01:56,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... [2018-12-03 18:01:56,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:01:56,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:01:56,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:01:56,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:01:56,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:01:56,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:01:57,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:01:57,069 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:01:57,069 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:57 BoogieIcfgContainer [2018-12-03 18:01:57,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:01:57,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:01:57,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:01:57,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:01:57,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:56" (1/2) ... [2018-12-03 18:01:57,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a7f9ba and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:57, skipping insertion in model container [2018-12-03 18:01:57,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:57" (2/2) ... [2018-12-03 18:01:57,081 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2018-12-03 18:01:57,093 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:01:57,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:01:57,123 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:01:57,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:01:57,171 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:01:57,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:01:57,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:01:57,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:01:57,172 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:01:57,172 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:01:57,172 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:01:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:01:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:01:57,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:57,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:01:57,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:57,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:01:57,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:57,383 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:01:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:01:57,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:57,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:01:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:01:57,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:01:57,405 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:01:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:57,458 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:01:57,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:01:57,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:01:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:57,471 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:01:57,472 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:01:57,475 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:01:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:01:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:01:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:01:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:01:57,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:01:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:57,514 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:01:57,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:01:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:01:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:01:57,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:57,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:01:57,515 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:57,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 18:01:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:57,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:57,627 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:01:57,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:57,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:57,629 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:01:57,631 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 18:01:57,694 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:01:57,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:01:58,015 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:01:58,016 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 1 different actions 6 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:01:58,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:58,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:01:58,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,064 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:01:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:58,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:58,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:58,206 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:01:58,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:58,296 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:01:58,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:58,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:01:58,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:58,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:01:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:01:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:01:58,322 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 18:01:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:58,347 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:01:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:01:58,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 18:01:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:58,348 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:01:58,348 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:01:58,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:01:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:01:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:01:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:01:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:01:58,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:01:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:58,353 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:01:58,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:01:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:01:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:01:58,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:58,354 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:01:58,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:58,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:58,355 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 18:01:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:58,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:58,451 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:58,451 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:01:58,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,452 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:01:58,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:58,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:58,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:01:58,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:58,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:58,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 18:01:58,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:58,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:01:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:01:58,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:01:58,644 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 18:01:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:58,736 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:01:58,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:01:58,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:01:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:58,737 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:01:58,737 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:01:58,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:01:58,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:01:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:01:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:01:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:01:58,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:01:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:58,741 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:01:58,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:01:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:01:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:01:58,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:58,742 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:01:58,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:58,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 18:01:58,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:58,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:58,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:58,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:58,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:58,990 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:01:58,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:58,990 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:01:59,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:01:59,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:01:59,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:01:59,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:59,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:59,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:01:59,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:59,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:01:59,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:01:59,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:01:59,306 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 18:01:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:59,329 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:01:59,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:01:59,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 18:01:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:59,331 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:01:59,331 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:01:59,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:01:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:01:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:01:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:01:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:01:59,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:01:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:59,335 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:01:59,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:01:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:01:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:01:59,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:59,336 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:01:59,337 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:59,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:59,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 18:01:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:59,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:59,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:59,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:59,575 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:01:59,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,575 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:01:59,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:59,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:59,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:01:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 18:01:59,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:59,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:01:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:01:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:01:59,740 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 18:01:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:59,788 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:01:59,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:01:59,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:01:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:59,791 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:01:59,791 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:01:59,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:01:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:01:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:01:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:01:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:01:59,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:01:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:59,795 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:01:59,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:01:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:01:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:01:59,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:59,796 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:01:59,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:59,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 18:01:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:59,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:01:59,941 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:59,941 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:01:59,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:59,941 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:01:59,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:59,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:59,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:01:59,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:59,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:01:59,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:00,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-12-03 18:02:00,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:00,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:02:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:02:00,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:00,122 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 18:02:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:00,161 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:02:00,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:02:00,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 18:02:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:00,163 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:02:00,163 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:02:00,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:00,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:02:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:02:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:02:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:02:00,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:02:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:00,168 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:02:00,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:02:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:02:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:02:00,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:00,168 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:02:00,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:00,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 18:02:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:00,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:00,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:00,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:00,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:00,283 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:00,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:00,283 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:02:00,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:02:00,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:02:00,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:00,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 18:02:00,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:00,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:02:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:02:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:00,766 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 18:02:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:00,805 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:02:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:02:00,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 18:02:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:00,808 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:02:00,808 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:02:00,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:02:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:02:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:02:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:02:00,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:02:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:00,812 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:02:00,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:02:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:02:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:02:00,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:00,813 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:02:00,813 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:00,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 18:02:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:00,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:00,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:00,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:00,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:00,937 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:00,938 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:00,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:00,938 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:00,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:00,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:02:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:00,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:00,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:01,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:01,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 18:02:01,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:01,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:02:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:02:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:01,248 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 18:02:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:01,312 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:02:01,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:02:01,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 18:02:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:01,397 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:02:01,397 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:02:01,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:02:01,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:02:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:02:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:02:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:02:01,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:02:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:02:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:02:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:02:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:02:01,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:01,406 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:02:01,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:01,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 18:02:01,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:01,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:01,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:01,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:01,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:01,733 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:01,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:01,734 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:02:01,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:02:01,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:02:01,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:02:01,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:01,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:01,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:02,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:02:02,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:02:02,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:02,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:02:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:02:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:02:02,126 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 18:02:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:02,210 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:02:02,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:02:02,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 18:02:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:02,211 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:02:02,211 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:02:02,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:02:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:02:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:02:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:02:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:02:02,216 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:02:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:02,216 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:02:02,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:02:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:02:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:02:02,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:02,217 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:02:02,218 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:02,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 18:02:02,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:02,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:02,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:02,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:02,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:02,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 18:02:02,367 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:02,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:02:02,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:02:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:02:02,368 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2018-12-03 18:02:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:02,408 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:02:02,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:02:02,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-12-03 18:02:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:02,410 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:02:02,410 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:02:02,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:02:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:02:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:02:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:02:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:02:02,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-12-03 18:02:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:02,412 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:02:02,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:02:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:02:02,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:02:02,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:02:02,572 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-03 18:02:02,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 38) no Hoare annotation was computed. [2018-12-03 18:02:02,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 38) no Hoare annotation was computed. [2018-12-03 18:02:02,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 38) no Hoare annotation was computed. [2018-12-03 18:02:02,575 INFO L444 ceAbstractionStarter]: At program point L28(lines 28 36) the Hoare annotation is: false [2018-12-03 18:02:02,575 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2018-12-03 18:02:02,576 INFO L444 ceAbstractionStarter]: At program point L35(lines 15 35) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 0) (<= 0 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 1)) (and (<= 3 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 3) (<= 4 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~sn~4 4)) (and (<= 9 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 16) (<= 16 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 10) (<= 6 ULTIMATE.start_main_~i~4) (<= 10 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 6)) (and (<= ULTIMATE.start_main_~sn~4 6) (<= ULTIMATE.start_main_~i~4 4) (<= 6 ULTIMATE.start_main_~sn~4) (<= 4 ULTIMATE.start_main_~i~4)) (and (<= 2 ULTIMATE.start_main_~sn~4) (<= 2 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~i~4 2) (<= ULTIMATE.start_main_~sn~4 2)) (and (<= 8 ULTIMATE.start_main_~sn~4) (<= ULTIMATE.start_main_~i~4 5) (<= 5 ULTIMATE.start_main_~i~4) (<= ULTIMATE.start_main_~sn~4 8)) (and (<= ULTIMATE.start_main_~i~4 7) (<= ULTIMATE.start_main_~sn~4 12) (<= 7 ULTIMATE.start_main_~i~4) (<= 12 ULTIMATE.start_main_~sn~4)) (and (<= ULTIMATE.start_main_~sn~4 14) (<= ULTIMATE.start_main_~i~4 8) (<= 8 ULTIMATE.start_main_~i~4) (<= 14 ULTIMATE.start_main_~sn~4))) [2018-12-03 18:02:02,588 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:02:02 BoogieIcfgContainer [2018-12-03 18:02:02,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:02:02,589 INFO L168 Benchmark]: Toolchain (without parser) took 5867.32 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 641.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -574.2 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2018-12-03 18:02:02,590 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:02,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:02,591 INFO L168 Benchmark]: Boogie Preprocessor took 24.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:02:02,592 INFO L168 Benchmark]: RCFGBuilder took 282.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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:02,593 INFO L168 Benchmark]: TraceAbstraction took 5515.84 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 641.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -595.4 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2018-12-03 18:02:02,597 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 282.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 5515.84 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 641.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -595.4 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((1 <= main_~i~4 && main_~sn~4 <= 0) && 0 <= main_~sn~4) && main_~i~4 <= 1) || (((3 <= main_~i~4 && main_~i~4 <= 3) && 4 <= main_~sn~4) && main_~sn~4 <= 4)) || ((9 <= main_~i~4 && main_~sn~4 <= 16) && 16 <= main_~sn~4)) || (((main_~sn~4 <= 10 && 6 <= main_~i~4) && 10 <= main_~sn~4) && main_~i~4 <= 6)) || (((main_~sn~4 <= 6 && main_~i~4 <= 4) && 6 <= main_~sn~4) && 4 <= main_~i~4)) || (((2 <= main_~sn~4 && 2 <= main_~i~4) && main_~i~4 <= 2) && main_~sn~4 <= 2)) || (((8 <= main_~sn~4 && main_~i~4 <= 5) && 5 <= main_~i~4) && main_~sn~4 <= 8)) || (((main_~i~4 <= 7 && main_~sn~4 <= 12) && 7 <= main_~i~4) && 12 <= main_~sn~4)) || (((main_~sn~4 <= 14 && main_~i~4 <= 8) && 8 <= main_~i~4) && 14 <= main_~sn~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 0 SDslu, 42 SDs, 0 SdLazy, 192 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 70 SyntacticMatches, 20 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 11 NumberOfFragments, 116 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 4675 SizeOfPredicates, 9 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 45/405 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...