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/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:11:57,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:11:57,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:11:57,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:11:57,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:11:57,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:11:57,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:11:57,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:11:57,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:11:57,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:11:57,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:11:57,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:11:57,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:11:57,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:11:58,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:11:58,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:11:58,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:11:58,008 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:11:58,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:11:58,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:11:58,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:11:58,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:11:58,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:11:58,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:11:58,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:11:58,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:11:58,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:11:58,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:11:58,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:11:58,029 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:11:58,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:11:58,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:11:58,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:11:58,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:11:58,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:11:58,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:11:58,034 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-07 14:11:58,057 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:11:58,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:11:58,058 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:11:58,058 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:11:58,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:11:58,061 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:11:58,061 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:11:58,061 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:11:58,061 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 14:11:58,061 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:11:58,062 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 14:11:58,062 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 14:11:58,062 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:11:58,062 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:11:58,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:11:58,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:11:58,063 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:11:58,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:11:58,065 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:11:58,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:11:58,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:11:58,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:11:58,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:11:58,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:11:58,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:11:58,066 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:11:58,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:11:58,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:11:58,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:11:58,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:11:58,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:11:58,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:11:58,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:11:58,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:11:58,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:11:58,069 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:11:58,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:11:58,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:11:58,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:11:58,069 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:11:58,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:11:58,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:11:58,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:11:58,131 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:11:58,131 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:11:58,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl [2019-01-07 14:11:58,133 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-01-07 14:11:58,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:11:58,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:11:58,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:11:58,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:11:58,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:11:58,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:11:58,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:11:58,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:11:58,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:11:58,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/1) ... [2019-01-07 14:11:58,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:11:58,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:11:58,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:11:58,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:11:58,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11: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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:11:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:11:58,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:11:58,604 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:11:58,605 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-07 14:11:58,606 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:11:58 BoogieIcfgContainer [2019-01-07 14:11:58,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:11:58,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:11:58,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:11:58,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:11:58,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:58" (1/2) ... [2019-01-07 14:11:58,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d871a0f and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:11:58, skipping insertion in model container [2019-01-07 14:11:58,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:11:58" (2/2) ... [2019-01-07 14:11:58,615 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bpl [2019-01-07 14:11:58,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:11:58,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:11:58,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:11:58,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:11:58,715 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:11:58,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:11:58,715 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:11:58,716 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:11:58,716 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:11:58,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:11:58,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:11:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:11:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:11:58,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:11:58,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:11:58,742 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:11:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:11:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-07 14:11:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:11:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:11:58,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:58,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:11:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:11:59,013 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:11:59,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~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-07 14:11:59,020 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-07 14:11:59,023 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-07 14:11:59,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:11:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:11:59,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:11:59,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:11:59,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:11:59,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:11:59,067 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-07 14:11:59,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:11:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:11:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:11:59,079 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 14:11:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,170 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:11:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:11:59,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:11:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:11:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:11:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:11:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:11:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:11:59,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-01-07 14:11:59,249 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-07 14:11:59,261 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:11:59,261 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:11:59,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:11:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:11:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:11:59,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:11:59,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:11:59,306 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:11:59,306 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:11:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,308 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:11:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:11:59,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:11:59,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:11:59,308 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:11:59,309 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:11:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,310 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:11:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:11:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:11:59,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:11:59,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:11:59,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:11:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:11:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:11:59,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:11:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:11:59,314 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:11:59,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:11:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:11:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:11:59,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:11:59,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:11:59,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:11:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:11:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-07 14:11:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:11:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:59,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:11:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:59,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:11:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:11:59,863 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:11:59,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:11:59,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~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-07 14:11:59,890 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:11:59,890 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-07 14:11:59,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:11:59,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:11:59,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 14:11:59,897 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-07 14:11:59,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:11:59,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:12:00,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:12:00,313 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 214 root evaluator evaluations with a maximum evaluation depth of 5. Performed 214 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-07 14:12:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:00,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:12:00,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:00,322 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-07 14:12:00,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:00,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:00,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:00,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:12:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2019-01-07 14:12:00,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:12:00,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 14:12:00,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2019-01-07 14:12:00,951 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:12:00,952 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_7, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_~key~5]. (and (not (< ULTIMATE.start_main_~key~5 (select v_ULTIMATE.start_main_~v~5_7 ULTIMATE.start_main_~i~5))) (<= 0 ULTIMATE.start_main_~i~5) (= (store v_ULTIMATE.start_main_~v~5_7 (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-01-07 14:12:00,952 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~i~5]. (and (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~i~5 1))) (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-01-07 14:12:01,041 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:12:01,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:12:01,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~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-07 14:12:01,046 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:12:01,047 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-07 14:12:01,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:01,516 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-07 14:12:01,529 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:12:01,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-07 14:12:01,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:12:01,554 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:12:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-07 14:12:01,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-07 14:12:01,659 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 13 treesize of output 11 [2019-01-07 14:12:01,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-07 14:12:01,924 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:12:01,927 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 14:12:01,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2019-01-07 14:12:01,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-07 14:12:01,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:12:01,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:5 [2019-01-07 14:12:01,969 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:12:01,970 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~v~5, v_ULTIMATE.start_main_~key~5_5, v_prenex_2, v_prenex_3]. (and (or (let ((.cse0 (store ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5 v_ULTIMATE.start_main_~key~5_5))) (<= (select .cse0 0) (select .cse0 1))) (< v_ULTIMATE.start_main_~key~5_5 (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))))) (or (<= 1 ULTIMATE.start_main_~j~5) (let ((.cse1 (store v_prenex_2 ULTIMATE.start_main_~j~5 v_prenex_3))) (<= (select .cse1 0) (select .cse1 1))))) [2019-01-07 14:12:01,970 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= 0 (+ ULTIMATE.start_main_~j~5 (- 1))) [2019-01-07 14:12:01,977 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:12:01,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~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-07 14:12:01,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-01-07 14:12:01,982 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-01-07 14:12:01,983 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-07 14:12:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-01-07 14:12:02,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:02,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:12:02,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:02,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:02,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:02,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:12:02,042 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-07 14:12:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:02,077 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:12:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:02,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:12:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-07 14:12:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-01-07 14:12:02,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5 transitions. [2019-01-07 14:12:02,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:02,119 INFO L225 Difference]: With dead ends: 5 [2019-01-07 14:12:02,119 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:12:02,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:12:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:12:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:12:02,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:02,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:02,122 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:02,122 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:02,122 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:12:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:02,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:02,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:02,123 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:02,123 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:02,123 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:12:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:02,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:02,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:02,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:02,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:12:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:12:02,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-07 14:12:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:02,124 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:12:02,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:02,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:02,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:12:02,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:12:02,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 55) no Hoare annotation was computed. [2019-01-07 14:12:02,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:12:02,168 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 56) no Hoare annotation was computed. [2019-01-07 14:12:02,169 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 54) the Hoare annotation is: false [2019-01-07 14:12:02,169 INFO L444 ceAbstractionStarter]: At program point L53(lines 26 53) the Hoare annotation is: (or (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))) [2019-01-07 14:12:02,170 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-07 14:12:02,180 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-07 14:12:02,180 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-07 14:12:02,181 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-07 14:12:02,181 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-07 14:12:02,187 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:12:02 BoogieIcfgContainer [2019-01-07 14:12:02,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:12:02,188 INFO L168 Benchmark]: Toolchain (without parser) took 4013.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -677.5 MB). Peak memory consumption was 57.0 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:02,189 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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. [2019-01-07 14:12:02,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.13 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. [2019-01-07 14:12:02,190 INFO L168 Benchmark]: Boogie Preprocessor took 22.53 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. [2019-01-07 14:12:02,191 INFO L168 Benchmark]: RCFGBuilder took 369.93 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. [2019-01-07 14:12:02,192 INFO L168 Benchmark]: TraceAbstraction took 3578.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -698.7 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:02,196 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 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 37.13 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 22.53 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 369.93 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 3578.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -698.7 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main_~v~5[0] <= main_~v~5[1] || (1 <= main_~j~5 && main_~j~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s 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.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...