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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:30:58,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:30:58,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:30:58,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:30:58,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:30:58,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:30:58,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:30:58,550 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:30:58,551 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:30:58,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:30:58,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:30:58,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:30:58,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:30:58,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:30:58,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:30:58,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:30:58,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:30:58,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:30:58,562 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:30:58,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:30:58,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:30:58,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:30:58,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:30:58,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:30:58,570 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:30:58,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:30:58,572 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:30:58,572 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:30:58,573 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:30:58,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:30:58,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:30:58,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:30:58,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:30:58,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:30:58,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:30:58,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:30:58,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:30:58,591 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:30:58,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:30:58,593 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:30:58,593 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:30:58,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:30:58,593 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:30:58,593 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:30:58,594 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:30:58,594 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:30:58,594 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:30:58,594 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:30:58,594 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:30:58,595 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:30:58,595 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:30:58,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:30:58,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:30:58,596 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:30:58,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:30:58,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:30:58,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:30:58,598 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:30:58,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:30:58,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:30:58,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:30:58,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:30:58,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:30:58,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:30:58,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:30:58,600 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:30:58,600 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:30:58,600 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:30:58,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:30:58,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:30:58,601 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:30:58,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:30:58,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:30:58,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:30:58,648 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:30:58,649 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:30:58,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl [2019-01-31 14:30:58,650 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array.i_3.bpl' [2019-01-31 14:30:58,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:30:58,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:30:58,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:30:58,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:30:58,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:30:58,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:30:58,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:30:58,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:30:58,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:30:58,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:30:58,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:30:59,090 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:30:59,091 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 14:30:59,092 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:30:59 BoogieIcfgContainer [2019-01-31 14:30:59,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:30:59,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:30:59,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:30:59,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:30:59,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/2) ... [2019-01-31 14:30:59,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e6ed9f and model type array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:30:59, skipping insertion in model container [2019-01-31 14:30:59,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:30:59" (2/2) ... [2019-01-31 14:30:59,102 INFO L112 eAbstractionObserver]: Analyzing ICFG array.i_3.bpl [2019-01-31 14:30:59,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:30:59,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:30:59,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:30:59,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:30:59,188 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:30:59,189 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:30:59,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:30:59,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:30:59,189 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:30:59,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:30:59,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:30:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 14:30:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:30:59,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:30:59,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:30:59,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:30:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:30:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-31 14:30:59,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:30:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:30:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:30:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:30:59,774 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-31 14:30:59,818 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5;main_~SIZE~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~array~5;havoc main_~menor~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~menor~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {11#(and (<= (div ULTIMATE.start_main_~SIZE~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)) (<= (div ULTIMATE.start_main_~SIZE~5 4294967296) 0) (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~SIZE~5))} is VALID [2019-01-31 14:30:59,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= (div ULTIMATE.start_main_~SIZE~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)) (<= (div ULTIMATE.start_main_~SIZE~5 4294967296) 0) (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~SIZE~5))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2019-01-31 14:30:59,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-31 14:30:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:30:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:30:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:30:59,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:30:59,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:30:59,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:30:59,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:30:59,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:30:59,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:30:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:30:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:30:59,883 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 14:30:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:30:59,966 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 14:30:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:30:59,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 14:30:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:30:59,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:30:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-31 14:30:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:30:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-31 14:30:59,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-01-31 14:31:00,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:00,029 INFO L225 Difference]: With dead ends: 9 [2019-01-31 14:31:00,030 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 14:31:00,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:31:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 14:31:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 14:31:00,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:00,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:00,140 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:00,140 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,144 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:00,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,145 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:00,145 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-31 14:31:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,146 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-31 14:31:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:00,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:00,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 14:31:00,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 14:31:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:00,155 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 14:31:00,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 14:31:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:31:00,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:00,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:31:00,157 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-31 14:31:00,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:00,785 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5;main_~SIZE~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~array~5;havoc main_~menor~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~menor~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {47#(= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-01-31 14:31:00,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5;main_~menor~5 := main_~array~5[main_~j~5 % 4294967296];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(= (select ULTIMATE.start_main_~array~5 0) ULTIMATE.start_main_~menor~5)} is VALID [2019-01-31 14:31:00,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(= (select ULTIMATE.start_main_~array~5 0) ULTIMATE.start_main_~menor~5)} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-31 14:31:00,809 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-31 14:31:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:00,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:00,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:00,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 14:31:00,814 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-31 14:31:00,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:00,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:01,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:01,024 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Performed 51 root evaluator evaluations with a maximum evaluation depth of 5. Performed 51 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:31:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:01,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:01,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:01,030 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-01-31 14:31:01,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:01,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:01,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:01,151 INFO L478 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 6 treesize of output 5 [2019-01-31 14:31:01,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:01,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:01,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-31 14:31:01,174 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:01,174 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~array~5_7, |v_ULTIMATE.start_main_#t~nondet2_4|]. (and (= (store v_ULTIMATE.start_main_~array~5_7 0 |v_ULTIMATE.start_main_#t~nondet2_4|) ULTIMATE.start_main_~array~5) (<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))) [2019-01-31 14:31:01,175 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0)) [2019-01-31 14:31:01,324 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5;main_~SIZE~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~array~5;havoc main_~menor~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~menor~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {52#(= ULTIMATE.start_main_~j~5 0)} is VALID [2019-01-31 14:31:01,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#(= ULTIMATE.start_main_~j~5 0)} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5;main_~menor~5 := main_~array~5[main_~j~5 % 4294967296];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {56#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-01-31 14:31:01,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-31 14:31:01,329 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-31 14:31:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:01,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:01,498 INFO L478 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-01-31 14:31:01,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:01,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:31:01,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-31 14:31:01,527 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-31 14:31:01,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {56#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~array~5[0] >= main_~menor~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-31 14:31:01,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~array~5 := main_~array~5[main_~j~5 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume main_~array~5[main_~j~5 % 4294967296] <= main_~menor~5;main_~menor~5 := main_~array~5[main_~j~5 % 4294967296];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {56#(<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0))} is VALID [2019-01-31 14:31:01,563 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~SIZE~5, main_~j~5, main_~k~5, main_~array~5, main_~menor~5;main_~SIZE~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~array~5;havoc main_~menor~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~menor~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {47#(= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-01-31 14:31:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:31:01,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:01,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 14:31:01,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:01,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 14:31:01,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:01,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:31:01,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:01,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:31:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:31:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:01,597 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2019-01-31 14:31:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:01,698 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-31 14:31:01,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:01,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 14:31:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-31 14:31:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-31 14:31:01,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7 transitions. [2019-01-31 14:31:01,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:31:01,715 INFO L225 Difference]: With dead ends: 6 [2019-01-31 14:31:01,715 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:01,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:01,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:01,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:01,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:01,717 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:01,717 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:01,718 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:01,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:01,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:01,718 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:01,718 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:01,719 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:01,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:01,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:01,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:01,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:01,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-31 14:31:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:01,720 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:01,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:31:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:01,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:01,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:02,002 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-01-31 14:31:02,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 53) no Hoare annotation was computed. [2019-01-31 14:31:02,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-31 14:31:02,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 53) no Hoare annotation was computed. [2019-01-31 14:31:02,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 53) no Hoare annotation was computed. [2019-01-31 14:31:02,066 INFO L444 ceAbstractionStarter]: At program point L39(lines 39 51) the Hoare annotation is: false [2019-01-31 14:31:02,066 INFO L444 ceAbstractionStarter]: At program point L50(lines 26 50) the Hoare annotation is: (or (<= ULTIMATE.start_main_~menor~5 (select ULTIMATE.start_main_~array~5 0)) (and (= ULTIMATE.start_main_~j~5 0) (<= (div ULTIMATE.start_main_~SIZE~5 4294967296) 0) (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~SIZE~5))) [2019-01-31 14:31:02,068 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:02,094 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:02,094 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:02,094 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-31 14:31:02,095 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 14:31:02,102 INFO L202 PluginConnector]: Adding new model array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:02 BoogieIcfgContainer [2019-01-31 14:31:02,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:02,104 INFO L168 Benchmark]: Toolchain (without parser) took 3410.21 ms. Allocated memory was 140.0 MB in the beginning and 219.2 MB in the end (delta: 79.2 MB). Free memory was 107.3 MB in the beginning and 196.5 MB in the end (delta: -89.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:02,105 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:02,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:02,107 INFO L168 Benchmark]: Boogie Preprocessor took 25.43 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:02,107 INFO L168 Benchmark]: RCFGBuilder took 331.17 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 93.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:02,108 INFO L168 Benchmark]: TraceAbstraction took 3009.17 ms. Allocated memory was 140.0 MB in the beginning and 219.2 MB in the end (delta: 79.2 MB). Free memory was 92.9 MB in the beginning and 196.5 MB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:02,113 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.20 ms. Allocated memory is still 140.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 140.0 MB. Free memory was 107.3 MB in the beginning and 105.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.43 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.17 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 93.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3009.17 ms. Allocated memory was 140.0 MB in the beginning and 219.2 MB in the end (delta: 79.2 MB). Free memory was 92.9 MB in the beginning and 196.5 MB in the end (delta: -103.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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: 39]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main_~menor~5 <= main_~array~5[0] || ((main_~j~5 == 0 && main_~SIZE~5 / 4294967296 <= 0) && main_~j~5 + 1 <= main_~SIZE~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 21 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 6 NumberOfNonLiveVariables, 27 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...