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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:15:10,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:15:10,731 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:15:10,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:15:10,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:15:10,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:15:10,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:15:10,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:15:10,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:15:10,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:15:10,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:15:10,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:15:10,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:15:10,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:15:10,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:15:10,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:15:10,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:15:10,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:15:10,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:15:10,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:15:10,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:15:10,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:15:10,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:15:10,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:15:10,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:15:10,770 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:15:10,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:15:10,772 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:15:10,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:15:10,773 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:15:10,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:15:10,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:15:10,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:15:10,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:15:10,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:15:10,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:15:10,779 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:15:10,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:15:10,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:15:10,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:15:10,827 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:15:10,830 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:15:10,832 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:15:10,833 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:15:10,833 INFO L430 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-05-15 10:15:10,834 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-05-15 10:15:10,880 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:15:10,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:15:10,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:15:10,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:15:10,900 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,911 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:15:10,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:15:10,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:15:10,932 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,932 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,933 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,933 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,937 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,939 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,940 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 15.05 10:15:10" (1/1) ... [2019-05-15 10:15:10,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:15:10,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:15:10,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:15:10,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:15:10,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:15:11,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:15:11,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:15:11,701 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:15:11,702 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-05-15 10:15:11,703 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:15:11 BoogieIcfgContainer [2019-05-15 10:15:11,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:15:11,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:15:11,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:15:11,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:15:11,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:15:10" (1/2) ... [2019-05-15 10:15:11,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6324a9a0 and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:15:11, skipping insertion in model container [2019-05-15 10:15:11,710 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 15.05 10:15:11" (2/2) ... [2019-05-15 10:15:11,712 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bpl [2019-05-15 10:15:11,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:15:11,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:15:11,739 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:15:11,763 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:15:11,764 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:15:11,764 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:15:11,764 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:15:11,764 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:15:11,764 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:15:11,765 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:15:11,765 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:15:11,765 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:15:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-05-15 10:15:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-05-15 10:15:11,789 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:11,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:11,792 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1812219286, now seen corresponding path program 1 times [2019-05-15 10:15:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-15 10:15:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:11,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:12,242 INFO L273 TraceCheckUtils]: 0: Hoare triple {32#true} havoc main_#res; {32#true} is VALID [2019-05-15 10:15:12,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} 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; {32#true} is VALID [2019-05-15 10:15:12,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} main_~SIZE~5 := main_#t~nondet0; {32#true} is VALID [2019-05-15 10:15:12,246 INFO L273 TraceCheckUtils]: 3: Hoare triple {32#true} havoc main_#t~nondet0; {32#true} is VALID [2019-05-15 10:15:12,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#true} havoc main_~i~5; {32#true} is VALID [2019-05-15 10:15:12,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} havoc main_~j~5; {32#true} is VALID [2019-05-15 10:15:12,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} havoc main_~k~5; {32#true} is VALID [2019-05-15 10:15:12,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} havoc main_~key~5; {32#true} is VALID [2019-05-15 10:15:12,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} havoc main_~v~5; {32#true} is VALID [2019-05-15 10:15:12,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#true} main_~j~5 := 1; {64#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:12,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#(= ULTIMATE.start_main_~j~5 1)} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {68#(<= (mod ULTIMATE.start_main_~SIZE~5 4294967296) 1)} is VALID [2019-05-15 10:15:12,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#(<= (mod ULTIMATE.start_main_~SIZE~5 4294967296) 1)} main_~k~5 := 1; {72#(and (<= (mod ULTIMATE.start_main_~SIZE~5 4294967296) 1) (= ULTIMATE.start_main_~k~5 1))} is VALID [2019-05-15 10:15:12,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {72#(and (<= (mod ULTIMATE.start_main_~SIZE~5 4294967296) 1) (= ULTIMATE.start_main_~k~5 1))} assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296); {33#false} is VALID [2019-05-15 10:15:12,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} __VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0); {33#false} is VALID [2019-05-15 10:15:12,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} havoc __VERIFIER_assert_~cond; {33#false} is VALID [2019-05-15 10:15:12,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33#false} is VALID [2019-05-15 10:15:12,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume __VERIFIER_assert_~cond == 0; {33#false} is VALID [2019-05-15 10:15:12,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2019-05-15 10:15:12,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {33#false} assume !false; {33#false} is VALID [2019-05-15 10:15:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:12,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:15:12,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-05-15 10:15:12,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-05-15 10:15:12,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:12,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:15:12,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:12,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:15:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:15:12,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:15:12,502 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-05-15 10:15:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:12,909 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:15:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:15:12,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-05-15 10:15:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-05-15 10:15:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:15:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2019-05-15 10:15:12,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2019-05-15 10:15:13,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:13,018 INFO L225 Difference]: With dead ends: 36 [2019-05-15 10:15:13,018 INFO L226 Difference]: Without dead ends: 34 [2019-05-15 10:15:13,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:15:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-05-15 10:15:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-05-15 10:15:13,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:13,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2019-05-15 10:15:13,046 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2019-05-15 10:15:13,046 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2019-05-15 10:15:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:13,052 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:15:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:15:13,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:13,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:13,054 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2019-05-15 10:15:13,054 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2019-05-15 10:15:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:13,058 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:15:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:15:13,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:13,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:13,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:13,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:15:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-15 10:15:13,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-05-15 10:15:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:13,064 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-05-15 10:15:13,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:15:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:15:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-05-15 10:15:13,068 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:13,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:13,069 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:13,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash -403927918, now seen corresponding path program 1 times [2019-05-15 10:15:13,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:13,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:15:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:13,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:13,566 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-05-15 10:15:13,642 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-05-15 10:15:13,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:15:13,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:15:13,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:15:13,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2019-05-15 10:15:13,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:15:13,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_8, ULTIMATE.start_main_~key~5]. (and (= (store v_ULTIMATE.start_main_~v~5_8 1 ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= (select v_ULTIMATE.start_main_~v~5_8 0) ULTIMATE.start_main_~key~5)) [2019-05-15 10:15:13,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) [2019-05-15 10:15:13,877 INFO L273 TraceCheckUtils]: 0: Hoare triple {229#true} havoc main_#res; {229#true} is VALID [2019-05-15 10:15:13,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {229#true} 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; {229#true} is VALID [2019-05-15 10:15:13,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {229#true} main_~SIZE~5 := main_#t~nondet0; {229#true} is VALID [2019-05-15 10:15:13,878 INFO L273 TraceCheckUtils]: 3: Hoare triple {229#true} havoc main_#t~nondet0; {229#true} is VALID [2019-05-15 10:15:13,878 INFO L273 TraceCheckUtils]: 4: Hoare triple {229#true} havoc main_~i~5; {229#true} is VALID [2019-05-15 10:15:13,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {229#true} havoc main_~j~5; {229#true} is VALID [2019-05-15 10:15:13,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {229#true} havoc main_~k~5; {229#true} is VALID [2019-05-15 10:15:13,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {229#true} havoc main_~key~5; {229#true} is VALID [2019-05-15 10:15:13,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {229#true} havoc main_~v~5; {229#true} is VALID [2019-05-15 10:15:13,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {229#true} main_~j~5 := 1; {261#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:13,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {261#(= ULTIMATE.start_main_~j~5 1)} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {261#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:13,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {261#(= ULTIMATE.start_main_~j~5 1)} main_~key~5 := main_~v~5[main_~j~5]; {261#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:13,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {261#(= ULTIMATE.start_main_~j~5 1)} main_~i~5 := main_~j~5 - 1; {271#(= ULTIMATE.start_main_~i~5 0)} is VALID [2019-05-15 10:15:13,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {271#(= ULTIMATE.start_main_~i~5 0)} assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5); {275#(and (= ULTIMATE.start_main_~i~5 0) (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~key~5))} is VALID [2019-05-15 10:15:13,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {275#(and (= ULTIMATE.start_main_~i~5 0) (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~key~5))} main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5]; {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:13,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_#t~post1 := main_~j~5; {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:13,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_~j~5 := main_#t~post1 + 1; {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:13,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} havoc main_#t~post1; {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:13,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:13,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {279#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_~k~5 := 1; {295#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} is VALID [2019-05-15 10:15:13,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {295#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296); {295#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} is VALID [2019-05-15 10:15:13,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {295#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} __VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0); {302#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:13,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {302#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} havoc __VERIFIER_assert_~cond; {302#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:13,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {302#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {309#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2019-05-15 10:15:13,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {309#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume __VERIFIER_assert_~cond == 0; {230#false} is VALID [2019-05-15 10:15:13,938 INFO L273 TraceCheckUtils]: 25: Hoare triple {230#false} assume !false; {230#false} is VALID [2019-05-15 10:15:13,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {230#false} assume !false; {230#false} is VALID [2019-05-15 10:15:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:13,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:15:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-15 10:15:13,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-05-15 10:15:13,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:13,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-05-15 10:15:14,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-05-15 10:15:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-15 10:15:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:15:14,043 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2019-05-15 10:15:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,776 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:15:14,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-15 10:15:14,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-05-15 10:15:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:15:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2019-05-15 10:15:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:15:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2019-05-15 10:15:14,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2019-05-15 10:15:14,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:14,859 INFO L225 Difference]: With dead ends: 46 [2019-05-15 10:15:14,860 INFO L226 Difference]: Without dead ends: 40 [2019-05-15 10:15:14,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-05-15 10:15:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-05-15 10:15:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-05-15 10:15:14,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:14,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 36 states. [2019-05-15 10:15:14,865 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 36 states. [2019-05-15 10:15:14,865 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 36 states. [2019-05-15 10:15:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,868 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:15:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:15:14,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,869 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 40 states. [2019-05-15 10:15:14,869 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 40 states. [2019-05-15 10:15:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:14,872 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:15:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:15:14,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:14,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:14,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:14,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:15:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-05-15 10:15:14,875 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-05-15 10:15:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:14,876 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-05-15 10:15:14,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-05-15 10:15:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:15:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-05-15 10:15:14,877 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:15:14,877 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:15:14,878 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:15:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:15:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1517545586, now seen corresponding path program 2 times [2019-05-15 10:15:14,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:15:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:15,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-15 10:15:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:15:15,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:15:15,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:15:15,724 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-05-15 10:15:15,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:15:15,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:15:15,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:15:15,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2019-05-15 10:15:15,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:15:15,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_9, ULTIMATE.start_main_~key~5]. (and (= (store v_ULTIMATE.start_main_~v~5_9 ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= (select v_ULTIMATE.start_main_~v~5_9 (+ ULTIMATE.start_main_~j~5 (- 1))) ULTIMATE.start_main_~key~5) (= ULTIMATE.start_main_~j~5 1)) [2019-05-15 10:15:15,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~j~5 1) (<= (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))) (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5))) [2019-05-15 10:15:15,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:15:15,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:15:15,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2019-05-15 10:15:15,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:15:15,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:15:15,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:15:15,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-05-15 10:15:15,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:15:15,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_10, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_~key~5]. (and (= (store v_ULTIMATE.start_main_~v~5_10 (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= (select v_ULTIMATE.start_main_~v~5_10 0) (select v_ULTIMATE.start_main_~v~5_10 1)) (<= 1 ULTIMATE.start_main_~i~5)) [2019-05-15 10:15:15,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) [2019-05-15 10:15:15,998 INFO L273 TraceCheckUtils]: 0: Hoare triple {496#true} havoc main_#res; {496#true} is VALID [2019-05-15 10:15:15,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {496#true} 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; {496#true} is VALID [2019-05-15 10:15:15,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {496#true} main_~SIZE~5 := main_#t~nondet0; {496#true} is VALID [2019-05-15 10:15:15,999 INFO L273 TraceCheckUtils]: 3: Hoare triple {496#true} havoc main_#t~nondet0; {496#true} is VALID [2019-05-15 10:15:16,000 INFO L273 TraceCheckUtils]: 4: Hoare triple {496#true} havoc main_~i~5; {496#true} is VALID [2019-05-15 10:15:16,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {496#true} havoc main_~j~5; {496#true} is VALID [2019-05-15 10:15:16,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {496#true} havoc main_~k~5; {496#true} is VALID [2019-05-15 10:15:16,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {496#true} havoc main_~key~5; {496#true} is VALID [2019-05-15 10:15:16,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {496#true} havoc main_~v~5; {496#true} is VALID [2019-05-15 10:15:16,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#true} main_~j~5 := 1; {528#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:16,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {528#(= ULTIMATE.start_main_~j~5 1)} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {528#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:16,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {528#(= ULTIMATE.start_main_~j~5 1)} main_~key~5 := main_~v~5[main_~j~5]; {528#(= ULTIMATE.start_main_~j~5 1)} is VALID [2019-05-15 10:15:16,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {528#(= ULTIMATE.start_main_~j~5 1)} main_~i~5 := main_~j~5 - 1; {538#(and (= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~j~5) (= ULTIMATE.start_main_~j~5 1))} is VALID [2019-05-15 10:15:16,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {538#(and (= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~j~5) (= ULTIMATE.start_main_~j~5 1))} assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5); {542#(and (= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~j~5) (= ULTIMATE.start_main_~j~5 1) (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~key~5))} is VALID [2019-05-15 10:15:16,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#(and (= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~j~5) (= ULTIMATE.start_main_~j~5 1) (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) ULTIMATE.start_main_~key~5))} main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5]; {546#(and (= ULTIMATE.start_main_~j~5 1) (<= (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))) (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5)))} is VALID [2019-05-15 10:15:16,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#(and (= ULTIMATE.start_main_~j~5 1) (<= (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))) (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5)))} main_#t~post1 := main_~j~5; {550#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 |ULTIMATE.start_main_#t~post1|))} is VALID [2019-05-15 10:15:16,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {550#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 |ULTIMATE.start_main_#t~post1|))} main_~j~5 := main_#t~post1 + 1; {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} is VALID [2019-05-15 10:15:16,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} havoc main_#t~post1; {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} is VALID [2019-05-15 10:15:16,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} is VALID [2019-05-15 10:15:16,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} main_~key~5 := main_~v~5[main_~j~5]; {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} is VALID [2019-05-15 10:15:16,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {554#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 2 ULTIMATE.start_main_~j~5))} main_~i~5 := main_~j~5 - 1; {567#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 ULTIMATE.start_main_~i~5))} is VALID [2019-05-15 10:15:16,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {567#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 ULTIMATE.start_main_~i~5))} assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5); {567#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 ULTIMATE.start_main_~i~5))} is VALID [2019-05-15 10:15:16,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {567#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (<= 1 ULTIMATE.start_main_~i~5))} main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5]; {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:16,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_#t~post1 := main_~j~5; {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:16,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_~j~5 := main_#t~post1 + 1; {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:16,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} havoc main_#t~post1; {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:16,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296); {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-05-15 10:15:16,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {574#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} main_~k~5 := 1; {590#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} is VALID [2019-05-15 10:15:16,043 INFO L273 TraceCheckUtils]: 28: Hoare triple {590#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296); {590#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} is VALID [2019-05-15 10:15:16,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {590#(and (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (= ULTIMATE.start_main_~k~5 1))} __VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0); {597#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:16,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {597#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} havoc __VERIFIER_assert_~cond; {597#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} is VALID [2019-05-15 10:15:16,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {597#(= 1 |ULTIMATE.start___VERIFIER_assert_#in~cond|)} __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {604#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2019-05-15 10:15:16,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {604#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume __VERIFIER_assert_~cond == 0; {497#false} is VALID [2019-05-15 10:15:16,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {497#false} assume !false; {497#false} is VALID [2019-05-15 10:15:16,048 INFO L273 TraceCheckUtils]: 34: Hoare triple {497#false} assume !false; {497#false} is VALID [2019-05-15 10:15:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:15:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:15:16,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-15 10:15:16,054 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-05-15 10:15:16,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:15:16,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2019-05-15 10:15:16,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:16,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-05-15 10:15:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-15 10:15:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:15:16,129 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2019-05-15 10:15:16,660 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-05-15 10:15:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:17,191 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:15:17,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-15 10:15:17,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-05-15 10:15:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:15:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:15:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2019-05-15 10:15:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:15:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2019-05-15 10:15:17,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2019-05-15 10:15:17,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:15:17,242 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:15:17,242 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:15:17,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-05-15 10:15:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:15:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:15:17,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:15:17,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:17,244 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:17,244 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:17,245 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:17,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:17,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:17,245 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:17,246 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:15:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:15:17,246 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:15:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:17,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:15:17,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:15:17,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:15:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:15:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:15:17,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-05-15 10:15:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:15:17,248 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:15:17,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-05-15 10:15:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:15:17,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:15:17,253 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:15:17 BoogieIcfgContainer [2019-05-15 10:15:17,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:15:17,254 INFO L168 Benchmark]: Toolchain (without parser) took 6373.20 ms. Allocated memory was 139.5 MB in the beginning and 242.2 MB in the end (delta: 102.8 MB). Free memory was 108.8 MB in the beginning and 130.7 MB in the end (delta: -21.8 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:17,255 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:15:17,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 139.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:17,257 INFO L168 Benchmark]: Boogie Preprocessor took 21.86 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 106.2 MB in the end (delta: 873.6 kB). Peak memory consumption was 873.6 kB. Max. memory is 7.1 GB. [2019-05-15 10:15:17,257 INFO L168 Benchmark]: RCFGBuilder took 760.40 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 91.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:17,258 INFO L168 Benchmark]: TraceAbstraction took 5548.72 ms. Allocated memory was 139.5 MB in the beginning and 242.2 MB in the end (delta: 102.8 MB). Free memory was 91.2 MB in the beginning and 130.7 MB in the end (delta: -39.5 MB). Peak memory consumption was 63.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:15:17,263 INFO L337 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.22 ms. Allocated memory is still 139.5 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 139.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.86 ms. Allocated memory is still 139.5 MB. Free memory was 107.1 MB in the beginning and 106.2 MB in the end (delta: 873.6 kB). Peak memory consumption was 873.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 760.40 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 91.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5548.72 ms. Allocated memory was 139.5 MB in the beginning and 242.2 MB in the end (delta: 102.8 MB). Free memory was 91.2 MB in the beginning and 130.7 MB in the end (delta: -39.5 MB). Peak memory consumption was 63.3 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 67 SDslu, 227 SDs, 0 SdLazy, 261 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 9890 SizeOfPredicates, 21 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...