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/matrix.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:53,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:53,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:53,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:53,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:53,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:53,693 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:53,695 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:53,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:53,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:53,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:53,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:53,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:53,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:53,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:53,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:53,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:53,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:53,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:53,708 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:53,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:53,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:53,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:53,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:53,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:53,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:53,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:53,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:53,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:53,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:53,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:53,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:53,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:53,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:53,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:53,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:53,722 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-25 15:36:53,735 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:53,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:53,736 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:53,737 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:53,737 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:53,737 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:53,737 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:53,737 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:53,738 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:53,738 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:53,738 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:53,738 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:53,738 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:53,739 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:53,739 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:53,739 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:53,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:53,740 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:53,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:53,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:53,740 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:53,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:53,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:53,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:53,741 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:53,741 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:53,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:53,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:53,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:53,742 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:53,742 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:53,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:53,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:53,743 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:53,743 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:53,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:53,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:53,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:53,744 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:53,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:53,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:53,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:53,796 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:53,796 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:53,797 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl [2019-02-25 15:36:53,797 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl' [2019-02-25 15:36:53,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:53,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:53,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:53,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:53,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:53,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:53,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:53,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:53,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:53,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... [2019-02-25 15:36:53,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:53,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:53,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:53,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:53,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:53,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:53,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:54,173 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-25 15:36:54,174 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:54,175 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-25 15:36:54,176 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:54 BoogieIcfgContainer [2019-02-25 15:36:54,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:54,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:54,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:54,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:54,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:53" (1/2) ... [2019-02-25 15:36:54,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38da485c and model type matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:54, skipping insertion in model container [2019-02-25 15:36:54,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:54" (2/2) ... [2019-02-25 15:36:54,185 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix.i_4.bpl [2019-02-25 15:36:54,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:54,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:54,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:54,242 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:54,243 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:54,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:54,243 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:54,243 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:54,243 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:54,244 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:54,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-02-25 15:36:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:36:54,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:36:54,270 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-25 15:36:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,637 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-02-25 15:36:54,639 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-25 15:36:54,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:36:54,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:36:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:36:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:54,664 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-02-25 15:36:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,724 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-25 15:36:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:36:54,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:36:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,737 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:36:54,738 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:54,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-25 15:36:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:36:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-25 15:36:54,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-02-25 15:36:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,777 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-25 15:36:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:36:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-25 15:36:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:36:54,778 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:36:54,779 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-02-25 15:36:54,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,081 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-02-25 15:36:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:55,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:55,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:36:55,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:55,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:36:55,218 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-25 15:36:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,331 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-25 15:36:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:55,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:36:55,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,333 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:36:55,333 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:55,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:36:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:36:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:36:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-25 15:36:55,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-25 15:36:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-25 15:36:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-25 15:36:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:55,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:36:55,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-02-25 15:36:55,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,625 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-02-25 15:36:56,006 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2019-02-25 15:36:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:56,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:36:56,131 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2019-02-25 15:36:56,185 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:56,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:56,261 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-25 15:37:12,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:37:12,341 INFO L272 AbstractInterpreter]: Visited 6 different actions 121 times. Merged at 5 different actions 83 times. Widened at 4 different actions 57 times. Found 34 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:37:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:12,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:37:12,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,348 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-25 15:37:12,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:12,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:12,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:37:12,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:12,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2019-02-25 15:37:12,625 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-02-25 15:37:12,625 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,631 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,643 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:37:12,643 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-02-25 15:37:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:12,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:12,694 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-02-25 15:37:12,710 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-02-25 15:37:12,711 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,734 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,755 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-02-25 15:37:12,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-02-25 15:37:12,772 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,784 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:37:12,795 INFO L301 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:37:12,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:37:12,800 INFO L208 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-02-25 15:37:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:37:12,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:12,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-02-25 15:37:12,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:12,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:37:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:37:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:37:12,899 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2019-02-25 15:37:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:13,020 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-02-25 15:37:13,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:37:13,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:37:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:13,021 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:37:13,021 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:37:13,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:37:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:37:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:37:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:37:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:37:13,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-25 15:37:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:13,022 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:37:13,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:37:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:37:13,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:37:13,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:37:13,473 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-02-25 15:37:13,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2019-02-25 15:37:13,477 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2019-02-25 15:37:13,477 INFO L444 ceAbstractionStarter]: At program point L59(lines 29 59) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~j~5 4294967296))) (let ((.cse0 (< 0 (+ .cse3 1))) (.cse1 (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0)) (.cse2 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~j~5 0) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) .cse3)) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 .cse1 .cse2)))) [2019-02-25 15:37:13,478 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 47) the Hoare annotation is: false [2019-02-25 15:37:13,478 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-25 15:37:13,478 INFO L444 ceAbstractionStarter]: At program point L70(lines 46 70) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1))) (.cse2 (div ULTIMATE.start_main_~N_LIN~5 4294967296)) (.cse1 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (= ULTIMATE.start_main_~k~5 0) .cse0 .cse1 (<= ULTIMATE.start_main_~j~5 0) (<= .cse2 (div ULTIMATE.start_main_~k~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 (<= .cse2 0) .cse1))) [2019-02-25 15:37:13,486 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:37:13 BoogieIcfgContainer [2019-02-25 15:37:13,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:37:13,487 INFO L168 Benchmark]: Toolchain (without parser) took 19649.34 ms. Allocated memory was 139.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 107.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 157.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:37:13,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:37:13,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.12 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 105.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:37:13,490 INFO L168 Benchmark]: Boogie Preprocessor took 21.25 ms. Allocated memory is still 139.5 MB. Free memory was 105.0 MB in the beginning and 104.0 MB in the end (delta: 936.8 kB). Peak memory consumption was 936.8 kB. Max. memory is 7.1 GB. [2019-02-25 15:37:13,491 INFO L168 Benchmark]: RCFGBuilder took 278.65 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-02-25 15:37:13,492 INFO L168 Benchmark]: TraceAbstraction took 19309.29 ms. Allocated memory was 139.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 93.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 144.5 MB. Max. memory is 7.1 GB. [2019-02-25 15:37:13,496 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 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.12 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 105.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 21.25 ms. Allocated memory is still 139.5 MB. Free memory was 105.0 MB in the beginning and 104.0 MB in the end (delta: 936.8 kB). Peak memory consumption was 936.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 278.65 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19309.29 ms. Allocated memory was 139.5 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 93.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 144.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 29]: Loop Invariant Derived loop invariant: (((((main_~j~5 + 1 <= main_~N_COL~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_COL~5 / 4294967296 <= main_~j~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((main_~k~5 == 0 && 0 < main_~j~5 / 4294967296 + 1) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_LIN~5 / 4294967296 <= main_~k~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 19.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 16.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 9 NumberOfFragments, 104 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 7 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...