java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-4b9831f [2018-12-23 14:26:56,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:26:56,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:26:56,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:26:56,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:26:56,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:26:56,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:26:56,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:26:56,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:26:56,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:26:56,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:26:56,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:26:56,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:26:56,962 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:26:56,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:26:56,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:26:56,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:26:56,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:26:56,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:26:56,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:26:56,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:26:56,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:26:56,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:26:56,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:26:56,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:26:56,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:26:56,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:26:56,979 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:26:56,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:26:56,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:26:56,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:26:56,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:26:56,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:26:56,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:26:56,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:26:56,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:26:56,987 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 [2018-12-23 14:26:57,000 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:26:57,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:26:57,001 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:26:57,001 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:26:57,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:26:57,002 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:26:57,002 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:26:57,002 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:26:57,002 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:26:57,003 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-23 14:26:57,003 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-23 14:26:57,003 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:26:57,003 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:26:57,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:26:57,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:26:57,004 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:26:57,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:26:57,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:26:57,006 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:26:57,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:26:57,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:26:57,006 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:26:57,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:26:57,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:26:57,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:26:57,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:26:57,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:26:57,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:26:57,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:26:57,008 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:26:57,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:26:57,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:26:57,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:26:57,008 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:26:57,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:26:57,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:26:57,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:26:57,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:26:57,069 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:26:57,070 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 [2018-12-23 14:26:57,070 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl' [2018-12-23 14:26:57,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:26:57,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:26:57,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:26:57,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:26:57,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:26:57,144 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 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,156 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 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:26:57,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:26:57,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:26:57,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:26:57,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/1) ... [2018-12-23 14:26:57,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:26:57,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:26:57,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:26:57,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:26:57,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (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-23 14:26:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-23 14:26:57,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-23 14:26:57,758 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-23 14:26:57,758 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-23 14:26:57,758 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:26:57 BoogieIcfgContainer [2018-12-23 14:26:57,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:26:57,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:26:57,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:26:57,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:26:57,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:26:57" (1/2) ... [2018-12-23 14:26:57,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b20ef8 and model type matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:26:57, skipping insertion in model container [2018-12-23 14:26:57,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:26:57" (2/2) ... [2018-12-23 14:26:57,767 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix.i_4.bpl [2018-12-23 14:26:57,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:26:57,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-23 14:26:57,806 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-23 14:26:57,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:26:57,842 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:26:57,842 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:26:57,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:26:57,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:26:57,843 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:26:57,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:26:57,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:26:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-23 14:26:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-23 14:26:57,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:26:57,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-23 14:26:57,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:26:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:26:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-23 14:26:57,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:26:57,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:57,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:26:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:57,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:26:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:26:58,267 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2018-12-23 14:26:58,286 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2018-12-23 14:26:58,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9#false} is VALID [2018-12-23 14:26:58,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} assume !false; {9#false} is VALID [2018-12-23 14:26:58,293 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-23 14:26:58,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:26:58,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-23 14:26:58,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:26:58,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:26:58,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:26:58,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:26:58,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:26:58,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:26:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:26:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:26:58,346 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-23 14:26:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:58,508 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-23 14:26:58,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:26:58,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-23 14:26:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:26:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:26:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:26:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:26:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:26:58,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-23 14:26:58,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:26:58,646 INFO L225 Difference]: With dead ends: 11 [2018-12-23 14:26:58,646 INFO L226 Difference]: Without dead ends: 7 [2018-12-23 14:26:58,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:26:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-23 14:26:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-23 14:26:58,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:26:58,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2018-12-23 14:26:58,760 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2018-12-23 14:26:58,760 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2018-12-23 14:26:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:58,762 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-23 14:26:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-23 14:26:58,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:26:58,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:26:58,764 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2018-12-23 14:26:58,764 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2018-12-23 14:26:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:58,765 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-23 14:26:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-23 14:26:58,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:26:58,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:26:58,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:26:58,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:26:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:26:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-23 14:26:58,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-23 14:26:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:26:58,771 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-23 14:26:58,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:26:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-23 14:26:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-23 14:26:58,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:26:58,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-23 14:26:58,772 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:26:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:26:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2018-12-23 14:26:58,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:26:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:58,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:26:58,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:58,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:26:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:26:59,161 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} is VALID [2018-12-23 14:26:59,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} is VALID [2018-12-23 14:26:59,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {57#false} is VALID [2018-12-23 14:26:59,172 INFO L273 TraceCheckUtils]: 3: Hoare triple {57#false} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {57#false} is VALID [2018-12-23 14:26:59,173 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-12-23 14:26:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:26:59,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:26:59,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-23 14:26:59,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:26:59,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:26:59,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:26:59,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:26:59,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:26:59,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:26:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:26:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:26:59,201 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-23 14:26:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:59,469 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-23 14:26:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:26:59,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:26:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:26:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:26:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-23 14:26:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:26:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-23 14:26:59,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-23 14:26:59,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:26:59,527 INFO L225 Difference]: With dead ends: 11 [2018-12-23 14:26:59,527 INFO L226 Difference]: Without dead ends: 7 [2018-12-23 14:26:59,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:26:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-23 14:26:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-23 14:26:59,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:26:59,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-23 14:26:59,581 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-23 14:26:59,581 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-23 14:26:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:59,583 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-23 14:26:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-23 14:26:59,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:26:59,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:26:59,584 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-23 14:26:59,584 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-23 14:26:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:26:59,588 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-23 14:26:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-23 14:26:59,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:26:59,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:26:59,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:26:59,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:26:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-23 14:26:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-23 14:26:59,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-23 14:26:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:26:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-23 14:26:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:26:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-23 14:26:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-23 14:26:59,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:26:59,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-23 14:26:59,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:26:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:26:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2018-12-23 14:26:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:26:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:26:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:26:59,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:26:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:27:00,070 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2018-12-23 14:27:00,584 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2018-12-23 14:27:00,736 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2018-12-23 14:27:00,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} is VALID [2018-12-23 14:27:00,740 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} is VALID [2018-12-23 14:27:00,741 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2018-12-23 14:27:00,742 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2018-12-23 14:27:00,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2018-12-23 14:27:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:27:00,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:27:00,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:27:00,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-23 14:27:00,747 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-23 14:27:00,801 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-23 14:27:00,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:27:00,951 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-23 14:27:00,951 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-23 14:27:00,952 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:27:00,953 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:27:00,954 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_1_1 Int) (v_v_0_1 (Array Int Int))) (and (= (select c_ULTIMATE.start_main_~matriz~5 v_idx_2) v_v_0_1) (= (select v_v_0_1 v_idx_1) v_v_1_1))))} [2018-12-23 14:27:00,954 WARN L228 ngHoareTripleChecker]: Action: havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; [2018-12-23 14:27:00,955 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 (+ |c_aux_v_ULTIMATE.start_main_#t~nondet0_3| 2147483648)) (= c_ULTIMATE.start_main_~maior~5_primed |c_aux_v_ULTIMATE.start_main_#t~nondet0_3|) (<= |c_aux_v_ULTIMATE.start_main_#t~nondet0_3| 2147483647) (= c_ULTIMATE.start_main_~j~5_primed 0) (= c_ULTIMATE.start_main_~N_COL~5_primed 1) (= c_ULTIMATE.start_main_~N_LIN~5_primed 1)) [2018-12-23 14:27:00,955 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_3 Int) (v_idx_4 Int)) (exists ((v_v_4_1 (Array Int Int)) (v_v_5_1 Int)) (and (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~j~5)) 0) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~j~5) 0) (<= (- c_ULTIMATE.start_main_~j~5 c_ULTIMATE.start_main_~maior~5) 2147483648) (<= (- c_ULTIMATE.start_main_~N_COL~5 (- c_ULTIMATE.start_main_~j~5)) 1) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) c_ULTIMATE.start_main_~maior~5) 2147483647) (<= (- (- c_ULTIMATE.start_main_~N_LIN~5) c_ULTIMATE.start_main_~maior~5) 2147483647) (<= (- c_ULTIMATE.start_main_~N_COL~5 (- c_ULTIMATE.start_main_~maior~5)) 2147483648) (<= (- (- c_ULTIMATE.start_main_~N_LIN~5) (- c_ULTIMATE.start_main_~j~5)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) c_ULTIMATE.start_main_~N_COL~5) (- 2)) (<= (- c_ULTIMATE.start_main_~N_COL~5 c_ULTIMATE.start_main_~N_LIN~5) 0) (<= (- c_ULTIMATE.start_main_~N_LIN~5 c_ULTIMATE.start_main_~maior~5) 2147483649) (<= (- c_ULTIMATE.start_main_~N_LIN~5 (- c_ULTIMATE.start_main_~N_LIN~5)) 2) (<= (- c_ULTIMATE.start_main_~N_LIN~5 c_ULTIMATE.start_main_~j~5) 1) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) c_ULTIMATE.start_main_~j~5) (- 1)) (<= (- (- c_ULTIMATE.start_main_~N_LIN~5) c_ULTIMATE.start_main_~j~5) (- 1)) (= (select c_ULTIMATE.start_main_~matriz~5 v_idx_4) v_v_4_1) (<= (- c_ULTIMATE.start_main_~N_COL~5 (- c_ULTIMATE.start_main_~N_COL~5)) 2) (<= (- (- c_ULTIMATE.start_main_~maior~5) c_ULTIMATE.start_main_~maior~5) 4294967296) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) (- c_ULTIMATE.start_main_~j~5)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~j~5) (- c_ULTIMATE.start_main_~maior~5)) 2147483647) (<= (- c_ULTIMATE.start_main_~N_LIN~5 (- c_ULTIMATE.start_main_~j~5)) 1) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) (- c_ULTIMATE.start_main_~N_LIN~5)) 0) (<= (- c_ULTIMATE.start_main_~N_COL~5 c_ULTIMATE.start_main_~j~5) 1) (<= (- c_ULTIMATE.start_main_~N_COL~5 c_ULTIMATE.start_main_~maior~5) 2147483649) (<= (- (- c_ULTIMATE.start_main_~j~5) c_ULTIMATE.start_main_~maior~5) 2147483648) (<= (- (- c_ULTIMATE.start_main_~N_LIN~5) c_ULTIMATE.start_main_~N_LIN~5) (- 2)) (= (select v_v_4_1 v_idx_3) v_v_5_1) (<= (- c_ULTIMATE.start_main_~j~5 (- c_ULTIMATE.start_main_~maior~5)) 2147483647) (<= (- c_ULTIMATE.start_main_~N_COL~5 (- c_ULTIMATE.start_main_~N_LIN~5)) 2) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) (- c_ULTIMATE.start_main_~maior~5)) 2147483646) (<= (- c_ULTIMATE.start_main_~maior~5 (- c_ULTIMATE.start_main_~maior~5)) 4294967294) (<= (- (- c_ULTIMATE.start_main_~N_LIN~5) (- c_ULTIMATE.start_main_~maior~5)) 2147483646) (<= (- (- c_ULTIMATE.start_main_~N_COL~5) c_ULTIMATE.start_main_~N_LIN~5) (- 2)) (<= (- c_ULTIMATE.start_main_~N_LIN~5 (- c_ULTIMATE.start_main_~maior~5)) 2147483648))))} [2018-12-23 14:27:00,955 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:27:00,957 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:27:00,957 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:27:00,998 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.processDualQuantifier(QuantifierPusher.java:374) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:118) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:88) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.toStringSimplified(DebuggingHoareTripleChecker.java:308) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.logUnsoundness(DebuggingHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkValidity(DebuggingHoareTripleChecker.java:179) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.DebuggingHoareTripleChecker.checkInternal(DebuggingHoareTripleChecker.java:139) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:80) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.rcfg.RcfgDebugHelper.isPostSound(RcfgDebugHelper.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.assertIsPostSound(FixpointEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:254) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-12-23 14:27:01,007 INFO L168 Benchmark]: Toolchain (without parser) took 3887.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-12-23 14:27:01,008 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:27:01,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:27:01,011 INFO L168 Benchmark]: Boogie Preprocessor took 27.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:27:01,012 INFO L168 Benchmark]: RCFGBuilder took 560.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-23 14:27:01,013 INFO L168 Benchmark]: TraceAbstraction took 3245.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2018-12-23 14:27:01,019 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.57 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 560.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3245.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 116.3 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ClassCastException: de.uni_freiburg.informatik.ultimate.logic.ApplicationTerm cannot be cast to de.uni_freiburg.informatik.ultimate.logic.QuantifiedFormula: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...