java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex05-SelectionSort.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:08,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:08,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:08,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:08,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:08,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:08,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:08,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:08,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:08,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:08,671 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:08,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:08,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:08,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:08,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:08,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:08,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:08,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:08,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:08,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:08,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:08,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:08,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:08,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:08,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:08,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:08,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:08,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:08,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:08,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:08,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:08,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:08,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:08,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:08,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:08,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:08,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:08,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:08,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:08,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:08,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:08,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:08,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:08,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:08,763 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:08,764 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:08,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex05-SelectionSort.bpl [2019-08-05 10:31:08,765 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex05-SelectionSort.bpl' [2019-08-05 10:31:08,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:08,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:08,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:08,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:08,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:08,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,844 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:08,845 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:08,845 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:08,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:08,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:08,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:08,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:08,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:08,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:08,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:08,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:08,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (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-08-05 10:31:08,945 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SelectionSort given in one single declaration [2019-08-05 10:31:08,946 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2019-08-05 10:31:08,946 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2019-08-05 10:31:09,019 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:31:09,245 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:09,245 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:09,246 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:09 BoogieIcfgContainer [2019-08-05 10:31:09,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:09,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:09,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:09,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:09,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/2) ... [2019-08-05 10:31:09,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad2e423 and model type 2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:09, skipping insertion in model container [2019-08-05 10:31:09,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:09" (2/2) ... [2019-08-05 10:31:09,255 INFO L109 eAbstractionObserver]: Analyzing ICFG 2019ProgVerif-Sheet12Ex05-SelectionSort.bpl [2019-08-05 10:31:09,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:09,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:09,291 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:09,313 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:09,313 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:09,313 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:09,314 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:09,314 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:09,314 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:09,314 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:09,314 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:09,314 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:31:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:09,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:09,339 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,348 INFO L82 PathProgramCache]: Analyzing trace with hash 52536, now seen corresponding path program 1 times [2019-08-05 10:31:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:09,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:31:09,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:09,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:09,560 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:31:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,644 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:31:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:09,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:31:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,656 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:09,657 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:31:09,659 INFO L628 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-08-05 10:31:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:31:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:31:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:31:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:31:09,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:31:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,693 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:31:09,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:31:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:09,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:31:09,695 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash 50037029, now seen corresponding path program 1 times [2019-08-05 10:31:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:09,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:09,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:31:09,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:09,842 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 5 states. [2019-08-05 10:31:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,068 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-08-05 10:31:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:10,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:31:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,070 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:10,070 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:10,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:31:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:31:10,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:31:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,074 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:31:10,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:31:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:10,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:31:10,075 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1551384265, now seen corresponding path program 1 times [2019-08-05 10:31:10,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:10,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:10,279 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 10:31:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,479 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 10:31:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:31:10,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:31:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,480 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:10,480 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:31:10,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08-05 10:31:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:31:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:31:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:31:10,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 10:31:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,483 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:31:10,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:31:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:31:10,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,484 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:31:10,485 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 526176886, now seen corresponding path program 2 times [2019-08-05 10:31:10,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:10,728 INFO L392 ElimStorePlain]: Different costs {3=[v_prenex_1], 5=[v_SelectionSort_ar_15]} [2019-08-05 10:31:10,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:10,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-08-05 10:31:10,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:10,843 INFO L567 ElimStorePlain]: treesize reduction 36, result has 33.3 percent of original size [2019-08-05 10:31:10,843 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_15 vanished before elimination [2019-08-05 10:31:10,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:10,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:18 [2019-08-05 10:31:10,985 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:31:11,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:11,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2019-08-05 10:31:11,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:11,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:11,104 INFO L496 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-08-05 10:31:11,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-08-05 10:31:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:11,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:11,150 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 8 states. [2019-08-05 10:31:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,315 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2019-08-05 10:31:11,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:11,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:31:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,319 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:31:11,319 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:11,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-08-05 10:31:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-08-05 10:31:11,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2019-08-05 10:31:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,324 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-08-05 10:31:11,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-08-05 10:31:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:11,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,325 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 10:31:11,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -627735982, now seen corresponding path program 3 times [2019-08-05 10:31:11,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:11,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:11,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:11,464 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 7 states. [2019-08-05 10:31:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,833 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 10:31:11,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:11,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:31:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,835 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:31:11,836 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:11,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-08-05 10:31:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:31:11,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-08-05 10:31:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,840 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:31:11,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:31:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:11,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,841 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:31:11,841 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1150603549, now seen corresponding path program 4 times [2019-08-05 10:31:11,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:11,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:11,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:31:11,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:31:11,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:31:11,931 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2019-08-05 10:31:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,009 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:31:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:31:12,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:31:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,010 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:12,011 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:31:12,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:31:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:31:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:31:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:31:12,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:31:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,015 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:31:12,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:31:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:31:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:12,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,016 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1] [2019-08-05 10:31:12,016 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:12,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -368335319, now seen corresponding path program 5 times [2019-08-05 10:31:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,694 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:31:12,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:12,811 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_2], 9=[v_prenex_3, v_prenex_4, v_SelectionSort_ar_17]} [2019-08-05 10:31:12,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:12,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:12,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:12,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2019-08-05 10:31:12,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,917 INFO L567 ElimStorePlain]: treesize reduction 134, result has 16.3 percent of original size [2019-08-05 10:31:12,918 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-08-05 10:31:12,918 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-08-05 10:31:12,918 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_17 vanished before elimination [2019-08-05 10:31:12,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:12,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:26 [2019-08-05 10:31:13,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:13,080 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_5], 9=[v_SelectionSort_ar_18]} [2019-08-05 10:31:13,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2019-08-05 10:31:13,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:13,147 INFO L567 ElimStorePlain]: treesize reduction 65, result has 30.9 percent of original size [2019-08-05 10:31:13,147 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_18 vanished before elimination [2019-08-05 10:31:13,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:13,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:29 [2019-08-05 10:31:13,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:13,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2019-08-05 10:31:13,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:13,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:13,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:31:13,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-08-05 10:31:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:13,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:13,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:13,297 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 12 states. [2019-08-05 10:31:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,611 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-08-05 10:31:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:13,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:31:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,613 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:13,613 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:13,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 10:31:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 10:31:13,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-08-05 10:31:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,618 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 10:31:13,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 10:31:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:13,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,619 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2019-08-05 10:31:13,619 INFO L418 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -143587323, now seen corresponding path program 6 times [2019-08-05 10:31:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:31:13,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:13,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:13,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:13,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:13,771 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 9 states. [2019-08-05 10:31:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,887 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-08-05 10:31:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:13,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 10:31:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,888 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:31:13,889 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:31:13,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:31:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-08-05 10:31:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 10:31:13,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-08-05 10:31:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,893 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 10:31:13,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 10:31:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:13,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,894 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2019-08-05 10:31:13,894 INFO L418 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1425238108, now seen corresponding path program 7 times [2019-08-05 10:31:13,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 10:31:13,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:13,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:13,994 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-08-05 10:31:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:14,088 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:31:14,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:14,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-08-05 10:31:14,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:14,090 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:31:14,090 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:31:14,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:31:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:31:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 10:31:14,094 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2019-08-05 10:31:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:14,095 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 10:31:14,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 10:31:14,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:14,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:14,095 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1] [2019-08-05 10:31:14,096 INFO L418 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1965261768, now seen corresponding path program 8 times [2019-08-05 10:31:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:15,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:31:15,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:15,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,684 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-08-05 10:31:15,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,690 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:15,722 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_9], 14=[v_prenex_7, v_SelectionSort_ar_20, v_prenex_6, v_prenex_8]} [2019-08-05 10:31:15,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:15,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2019-08-05 10:31:15,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:15,857 INFO L567 ElimStorePlain]: treesize reduction 441, result has 8.9 percent of original size [2019-08-05 10:31:15,857 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-08-05 10:31:15,857 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_20 vanished before elimination [2019-08-05 10:31:15,857 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-08-05 10:31:15,857 INFO L464 ElimStorePlain]: Eliminatee v_prenex_8 vanished before elimination [2019-08-05 10:31:15,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:15,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:492, output treesize:43 [2019-08-05 10:31:16,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,156 INFO L392 ElimStorePlain]: Different costs {10=[v_SelectionSort_ar_21], 14=[v_prenex_11, v_prenex_10]} [2019-08-05 10:31:16,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2019-08-05 10:31:16,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,295 INFO L567 ElimStorePlain]: treesize reduction 277, result has 14.5 percent of original size [2019-08-05 10:31:16,296 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-08-05 10:31:16,296 INFO L464 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2019-08-05 10:31:16,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:336, output treesize:47 [2019-08-05 10:31:16,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:16,428 INFO L392 ElimStorePlain]: Different costs {10=[v_SelectionSort_ar_22], 14=[v_prenex_12]} [2019-08-05 10:31:16,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,595 INFO L235 Elim1Store]: Index analysis took 143 ms [2019-08-05 10:31:16,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2019-08-05 10:31:16,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,706 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-08-05 10:31:16,707 INFO L567 ElimStorePlain]: treesize reduction 91, result has 34.1 percent of original size [2019-08-05 10:31:16,707 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-08-05 10:31:16,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:150, output treesize:47 [2019-08-05 10:31:16,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:16,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2019-08-05 10:31:16,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:16,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:16,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:47 [2019-08-05 10:31:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:16,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:16,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:16,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:16,877 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 18 states. [2019-08-05 10:31:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:17,315 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-08-05 10:31:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:17,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:31:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:17,317 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:31:17,317 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:17,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 10:31:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-08-05 10:31:17,322 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2019-08-05 10:31:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:17,322 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-08-05 10:31:17,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-08-05 10:31:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:17,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:17,323 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 4, 1, 1, 1] [2019-08-05 10:31:17,323 INFO L418 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 303424476, now seen corresponding path program 9 times [2019-08-05 10:31:17,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:17,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:17,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:31:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:17,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:17,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:17,587 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2019-08-05 10:31:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,013 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-08-05 10:31:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:18,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-08-05 10:31:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,014 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:31:18,015 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:18,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-08-05 10:31:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-08-05 10:31:18,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-08-05 10:31:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,019 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-08-05 10:31:18,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-08-05 10:31:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:18,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,020 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 5, 1, 1, 1] [2019-08-05 10:31:18,020 INFO L418 AbstractCegarLoop]: === Iteration 12 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash 851056521, now seen corresponding path program 10 times [2019-08-05 10:31:18,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 61 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-05 10:31:18,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:18,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:18,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:18,130 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2019-08-05 10:31:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,264 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 10:31:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:18,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-08-05 10:31:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,266 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:18,266 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:31:18,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:31:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:31:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 10:31:18,270 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-08-05 10:31:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,270 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 10:31:18,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 10:31:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:18,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,271 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1] [2019-08-05 10:31:18,272 INFO L418 AbstractCegarLoop]: === Iteration 13 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 572773989, now seen corresponding path program 11 times [2019-08-05 10:31:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:21,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:31:21,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:21,540 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:31:21,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,753 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 10:31:21,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,944 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-08-05 10:31:21,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:21,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:21,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,203 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-08-05 10:31:22,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:22,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,248 INFO L392 ElimStorePlain]: Different costs {15=[v_prenex_16], 20=[v_prenex_13, v_prenex_14, v_prenex_22, v_prenex_17, v_prenex_18, v_prenex_15, v_SelectionSort_ar_24, v_prenex_19, v_prenex_20, v_prenex_21]} [2019-08-05 10:31:22,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2019-08-05 10:31:22,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:22,470 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 25 [2019-08-05 10:31:22,470 INFO L567 ElimStorePlain]: treesize reduction 1104, result has 4.5 percent of original size [2019-08-05 10:31:22,470 INFO L464 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2019-08-05 10:31:22,471 INFO L464 ElimStorePlain]: Eliminatee v_prenex_14 vanished before elimination [2019-08-05 10:31:22,471 INFO L464 ElimStorePlain]: Eliminatee v_prenex_22 vanished before elimination [2019-08-05 10:31:22,471 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-08-05 10:31:22,471 INFO L464 ElimStorePlain]: Eliminatee v_prenex_18 vanished before elimination [2019-08-05 10:31:22,471 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-08-05 10:31:22,472 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_24 vanished before elimination [2019-08-05 10:31:22,472 INFO L464 ElimStorePlain]: Eliminatee v_prenex_19 vanished before elimination [2019-08-05 10:31:22,472 INFO L464 ElimStorePlain]: Eliminatee v_prenex_20 vanished before elimination [2019-08-05 10:31:22,472 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-08-05 10:31:22,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:22,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:1164, output treesize:52 [2019-08-05 10:31:22,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,859 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-08-05 10:31:22,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:22,883 INFO L392 ElimStorePlain]: Different costs {15=[v_SelectionSort_ar_25], 20=[v_prenex_24, v_prenex_25, v_prenex_23, v_prenex_26]} [2019-08-05 10:31:22,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:22,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2019-08-05 10:31:22,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,040 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 25 [2019-08-05 10:31:23,040 INFO L567 ElimStorePlain]: treesize reduction 770, result has 7.0 percent of original size [2019-08-05 10:31:23,041 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-08-05 10:31:23,041 INFO L464 ElimStorePlain]: Eliminatee v_prenex_25 vanished before elimination [2019-08-05 10:31:23,041 INFO L464 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2019-08-05 10:31:23,041 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-08-05 10:31:23,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:840, output treesize:58 [2019-08-05 10:31:23,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,292 INFO L392 ElimStorePlain]: Different costs {15=[v_prenex_27], 20=[v_prenex_28, v_prenex_29, v_SelectionSort_ar_26]} [2019-08-05 10:31:23,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 67 [2019-08-05 10:31:23,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,367 INFO L567 ElimStorePlain]: treesize reduction 326, result has 15.1 percent of original size [2019-08-05 10:31:23,368 INFO L464 ElimStorePlain]: Eliminatee v_prenex_28 vanished before elimination [2019-08-05 10:31:23,368 INFO L464 ElimStorePlain]: Eliminatee v_prenex_29 vanished before elimination [2019-08-05 10:31:23,368 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_26 vanished before elimination [2019-08-05 10:31:23,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:396, output treesize:58 [2019-08-05 10:31:23,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:23,516 INFO L392 ElimStorePlain]: Different costs {15=[v_prenex_30], 20=[v_SelectionSort_ar_27]} [2019-08-05 10:31:23,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 64 [2019-08-05 10:31:23,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,593 INFO L567 ElimStorePlain]: treesize reduction 102, result has 36.3 percent of original size [2019-08-05 10:31:23,593 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_27 vanished before elimination [2019-08-05 10:31:23,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:172, output treesize:58 [2019-08-05 10:31:23,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:23,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2019-08-05 10:31:23,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:23,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:23,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:58 [2019-08-05 10:31:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:23,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:23,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:23,796 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 24 states. [2019-08-05 10:31:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,326 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-08-05 10:31:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:24,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:31:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,328 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:24,328 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:31:24,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:31:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-08-05 10:31:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-08-05 10:31:24,334 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2019-08-05 10:31:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,334 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-08-05 10:31:24,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-08-05 10:31:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:24,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,335 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 5, 1, 1, 1] [2019-08-05 10:31:24,335 INFO L418 AbstractCegarLoop]: === Iteration 14 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 535950089, now seen corresponding path program 12 times [2019-08-05 10:31:24,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:31:24,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:24,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:24,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:24,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:24,569 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 13 states. [2019-08-05 10:31:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,857 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-08-05 10:31:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:24,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-08-05 10:31:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,859 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:31:24,859 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:31:24,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=526, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:31:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-08-05 10:31:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-08-05 10:31:24,864 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-08-05 10:31:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,865 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-08-05 10:31:24,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-08-05 10:31:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:24,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,866 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 6, 1, 1, 1] [2019-08-05 10:31:24,866 INFO L418 AbstractCegarLoop]: === Iteration 15 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,867 INFO L82 PathProgramCache]: Analyzing trace with hash 628628178, now seen corresponding path program 13 times [2019-08-05 10:31:24,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 116 proven. 30 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:31:25,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:25,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:25,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:25,093 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2019-08-05 10:31:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,284 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 10:31:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:25,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-08-05 10:31:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,286 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:31:25,286 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:25,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:31:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 10:31:25,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2019-08-05 10:31:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,291 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 10:31:25,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 10:31:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:25,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,292 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 6, 1, 1, 1] [2019-08-05 10:31:25,292 INFO L418 AbstractCegarLoop]: === Iteration 16 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash 582954102, now seen corresponding path program 14 times [2019-08-05 10:31:25,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:39,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:31:39,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,893 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 10:31:39,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:39,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:39,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,180 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:31:40,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:40,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,498 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-08-05 10:31:40,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:31:40,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,507 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:40,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,510 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:40,571 INFO L392 ElimStorePlain]: Different costs {21=[v_prenex_42], 27=[v_prenex_46, v_prenex_47, v_prenex_44, v_prenex_45, v_prenex_48, v_prenex_49, v_prenex_60, v_prenex_43, v_prenex_40, v_SelectionSort_ar_29, v_prenex_41, v_prenex_35, v_prenex_57, v_prenex_58, v_prenex_36, v_prenex_55, v_prenex_33, v_prenex_56, v_prenex_34, v_prenex_39, v_prenex_37, v_prenex_59, v_prenex_38, v_prenex_50, v_prenex_53, v_prenex_31, v_prenex_32, v_prenex_54, v_prenex_51, v_prenex_52]} [2019-08-05 10:31:40,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:40,991 INFO L235 Elim1Store]: Index analysis took 373 ms [2019-08-05 10:31:40,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2019-08-05 10:31:40,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:41,624 WARN L188 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 514 DAG size of output: 29 [2019-08-05 10:31:41,624 INFO L567 ElimStorePlain]: treesize reduction 2615, result has 2.3 percent of original size [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_46 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_47 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_44 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_45 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_48 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_49 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_60 vanished before elimination [2019-08-05 10:31:41,625 INFO L464 ElimStorePlain]: Eliminatee v_prenex_43 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_40 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_29 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_41 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_35 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_57 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_58 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_36 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_55 vanished before elimination [2019-08-05 10:31:41,626 INFO L464 ElimStorePlain]: Eliminatee v_prenex_33 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_56 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_34 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_39 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_37 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_59 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_38 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_50 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_53 vanished before elimination [2019-08-05 10:31:41,627 INFO L464 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2019-08-05 10:31:41,628 INFO L464 ElimStorePlain]: Eliminatee v_prenex_32 vanished before elimination [2019-08-05 10:31:41,628 INFO L464 ElimStorePlain]: Eliminatee v_prenex_54 vanished before elimination [2019-08-05 10:31:41,628 INFO L464 ElimStorePlain]: Eliminatee v_prenex_51 vanished before elimination [2019-08-05 10:31:41,628 INFO L464 ElimStorePlain]: Eliminatee v_prenex_52 vanished before elimination [2019-08-05 10:31:41,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 31 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:41,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 31 variables, input treesize:2684, output treesize:61 [2019-08-05 10:31:41,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:41,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:41,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:41,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:41,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,039 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:31:42,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,392 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-08-05 10:31:42,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:42,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:42,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:31:42,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:42,436 INFO L392 ElimStorePlain]: Different costs {21=[v_prenex_63], 27=[v_prenex_68, v_prenex_66, v_prenex_67, v_SelectionSort_ar_30, v_prenex_61, v_prenex_64, v_prenex_65, v_prenex_62]} [2019-08-05 10:31:42,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:42,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 83 [2019-08-05 10:31:42,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:42,757 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 29 [2019-08-05 10:31:42,757 INFO L567 ElimStorePlain]: treesize reduction 1927, result has 3.5 percent of original size [2019-08-05 10:31:42,758 INFO L464 ElimStorePlain]: Eliminatee v_prenex_68 vanished before elimination [2019-08-05 10:31:42,758 INFO L464 ElimStorePlain]: Eliminatee v_prenex_66 vanished before elimination [2019-08-05 10:31:42,758 INFO L464 ElimStorePlain]: Eliminatee v_prenex_67 vanished before elimination [2019-08-05 10:31:42,759 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_30 vanished before elimination [2019-08-05 10:31:42,759 INFO L464 ElimStorePlain]: Eliminatee v_prenex_61 vanished before elimination [2019-08-05 10:31:42,759 INFO L464 ElimStorePlain]: Eliminatee v_prenex_64 vanished before elimination [2019-08-05 10:31:42,759 INFO L464 ElimStorePlain]: Eliminatee v_prenex_65 vanished before elimination [2019-08-05 10:31:42,759 INFO L464 ElimStorePlain]: Eliminatee v_prenex_62 vanished before elimination [2019-08-05 10:31:42,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:42,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:2008, output treesize:69 [2019-08-05 10:31:42,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:43,960 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-05 10:31:43,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:43,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:43,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,757 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2019-08-05 10:31:44,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:44,786 INFO L392 ElimStorePlain]: Different costs {21=[v_prenex_75], 27=[v_prenex_69, v_SelectionSort_ar_31, v_prenex_71, v_prenex_72, v_prenex_70, v_prenex_73, v_prenex_74]} [2019-08-05 10:31:44,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:44,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:45,162 INFO L235 Elim1Store]: Index analysis took 338 ms [2019-08-05 10:31:45,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 85 [2019-08-05 10:31:45,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:45,938 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 29 [2019-08-05 10:31:45,939 INFO L567 ElimStorePlain]: treesize reduction 935, result has 6.9 percent of original size [2019-08-05 10:31:45,939 INFO L464 ElimStorePlain]: Eliminatee v_prenex_69 vanished before elimination [2019-08-05 10:31:45,939 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_31 vanished before elimination [2019-08-05 10:31:45,939 INFO L464 ElimStorePlain]: Eliminatee v_prenex_71 vanished before elimination [2019-08-05 10:31:45,940 INFO L464 ElimStorePlain]: Eliminatee v_prenex_72 vanished before elimination [2019-08-05 10:31:45,940 INFO L464 ElimStorePlain]: Eliminatee v_prenex_70 vanished before elimination [2019-08-05 10:31:45,940 INFO L464 ElimStorePlain]: Eliminatee v_prenex_73 vanished before elimination [2019-08-05 10:31:45,940 INFO L464 ElimStorePlain]: Eliminatee v_prenex_74 vanished before elimination [2019-08-05 10:31:45,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:45,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:1016, output treesize:69 [2019-08-05 10:31:46,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:46,603 INFO L392 ElimStorePlain]: Different costs {21=[v_prenex_77], 27=[v_SelectionSort_ar_32, v_prenex_76]} [2019-08-05 10:31:46,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:46,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 77 [2019-08-05 10:31:46,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:46,780 INFO L567 ElimStorePlain]: treesize reduction 359, result has 16.1 percent of original size [2019-08-05 10:31:46,780 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_32 vanished before elimination [2019-08-05 10:31:46,780 INFO L464 ElimStorePlain]: Eliminatee v_prenex_76 vanished before elimination [2019-08-05 10:31:46,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:31:46,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:440, output treesize:69 [2019-08-05 10:31:46,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:47,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:31:47,198 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-08-05 10:31:47,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:31:47,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:31:47,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 72 [2019-08-05 10:31:47,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:47,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,356 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:31:47,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2019-08-05 10:31:47,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:47,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:47,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-08-05 10:31:47,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:141 [2019-08-05 10:31:47,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:31:47,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:31:47,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2019-08-05 10:31:47,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:31:47,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:31:47,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:31:47,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2019-08-05 10:31:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:31:47,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:47,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:47,825 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 31 states. [2019-08-05 10:31:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,854 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-08-05 10:31:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:48,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:31:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,856 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:31:48,856 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:31:48,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:31:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 10:31:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-08-05 10:31:48,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2019-08-05 10:31:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,861 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-08-05 10:31:48,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-08-05 10:31:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:48,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,862 INFO L399 BasicCegarLoop]: trace histogram [16, 6, 6, 1, 1, 1] [2019-08-05 10:31:48,863 INFO L418 AbstractCegarLoop]: === Iteration 17 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash -832942254, now seen corresponding path program 15 times [2019-08-05 10:31:48,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 21 proven. 211 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 10:31:49,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:49,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:49,056 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 15 states. [2019-08-05 10:31:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:49,452 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-08-05 10:31:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:49,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-08-05 10:31:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:49,453 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:31:49,453 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:31:49,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=463, Invalid=869, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:31:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2019-08-05 10:31:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-08-05 10:31:49,458 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2019-08-05 10:31:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:49,459 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-08-05 10:31:49,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-08-05 10:31:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:31:49,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:49,460 INFO L399 BasicCegarLoop]: trace histogram [20, 7, 7, 1, 1, 1] [2019-08-05 10:31:49,460 INFO L418 AbstractCegarLoop]: === Iteration 18 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash -657780411, now seen corresponding path program 16 times [2019-08-05 10:31:49,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:49,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:31:49,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 199 proven. 45 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-08-05 10:31:49,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:49,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:49,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:49,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:49,720 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 14 states. [2019-08-05 10:31:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,041 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 10:31:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:50,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-08-05 10:31:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,042 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:31:50,042 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:50,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=537, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:31:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:31:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 10:31:50,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2019-08-05 10:31:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,047 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 10:31:50,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 10:31:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:31:50,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,048 INFO L399 BasicCegarLoop]: trace histogram [21, 7, 7, 1, 1, 1] [2019-08-05 10:31:50,049 INFO L418 AbstractCegarLoop]: === Iteration 19 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash 642268905, now seen corresponding path program 17 times [2019-08-05 10:31:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:50,717 WARN L254 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:33:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:50,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:50,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:50,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:50,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:50,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,013 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-05 10:33:51,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,307 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-08-05 10:33:51,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:51,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,757 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-08-05 10:33:51,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:51,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:51,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,268 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-08-05 10:33:52,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:52,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,317 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,320 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,335 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,342 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:52,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:52,397 INFO L392 ElimStorePlain]: Different costs {28=[v_prenex_100], 35=[v_prenex_88, v_prenex_89, v_prenex_82, v_prenex_83, v_prenex_80, v_prenex_81, v_prenex_86, v_prenex_87, v_prenex_84, v_prenex_85, v_prenex_79, v_prenex_99, v_prenex_78, v_prenex_93, v_prenex_94, v_prenex_91, v_SelectionSort_ar_35, v_prenex_92, v_prenex_97, v_prenex_98, v_prenex_95, v_prenex_96, v_prenex_102, v_prenex_101, v_prenex_90]} [2019-08-05 10:33:52,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:52,722 INFO L235 Elim1Store]: Index analysis took 273 ms [2019-08-05 10:33:52,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2019-08-05 10:33:52,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:53,944 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 582 DAG size of output: 35 [2019-08-05 10:33:53,944 INFO L567 ElimStorePlain]: treesize reduction 5998, result has 1.2 percent of original size [2019-08-05 10:33:53,945 INFO L464 ElimStorePlain]: Eliminatee v_prenex_88 vanished before elimination [2019-08-05 10:33:53,945 INFO L464 ElimStorePlain]: Eliminatee v_prenex_89 vanished before elimination [2019-08-05 10:33:53,945 INFO L464 ElimStorePlain]: Eliminatee v_prenex_82 vanished before elimination [2019-08-05 10:33:53,945 INFO L464 ElimStorePlain]: Eliminatee v_prenex_83 vanished before elimination [2019-08-05 10:33:53,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_80 vanished before elimination [2019-08-05 10:33:53,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_81 vanished before elimination [2019-08-05 10:33:53,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_86 vanished before elimination [2019-08-05 10:33:53,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_87 vanished before elimination [2019-08-05 10:33:53,946 INFO L464 ElimStorePlain]: Eliminatee v_prenex_84 vanished before elimination [2019-08-05 10:33:53,947 INFO L464 ElimStorePlain]: Eliminatee v_prenex_85 vanished before elimination [2019-08-05 10:33:53,947 INFO L464 ElimStorePlain]: Eliminatee v_prenex_79 vanished before elimination [2019-08-05 10:33:53,947 INFO L464 ElimStorePlain]: Eliminatee v_prenex_99 vanished before elimination [2019-08-05 10:33:53,947 INFO L464 ElimStorePlain]: Eliminatee v_prenex_78 vanished before elimination [2019-08-05 10:33:53,947 INFO L464 ElimStorePlain]: Eliminatee v_prenex_93 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_prenex_94 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_prenex_91 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_35 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_prenex_92 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_prenex_97 vanished before elimination [2019-08-05 10:33:53,948 INFO L464 ElimStorePlain]: Eliminatee v_prenex_98 vanished before elimination [2019-08-05 10:33:53,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_95 vanished before elimination [2019-08-05 10:33:53,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_96 vanished before elimination [2019-08-05 10:33:53,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_102 vanished before elimination [2019-08-05 10:33:53,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_101 vanished before elimination [2019-08-05 10:33:53,949 INFO L464 ElimStorePlain]: Eliminatee v_prenex_90 vanished before elimination [2019-08-05 10:33:53,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 26 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:33:53,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 26 variables, input treesize:6076, output treesize:70 [2019-08-05 10:33:54,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,347 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:33:54,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,894 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-08-05 10:33:54,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:54,898 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,242 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-08-05 10:33:55,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:33:55,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:55,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:55,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:55,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:55,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:33:55,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:55,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:55,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:55,300 INFO L392 ElimStorePlain]: Different costs {28=[v_prenex_106], 35=[v_prenex_104, v_prenex_103, v_prenex_105, v_prenex_107, v_SelectionSort_ar_36]} [2019-08-05 10:33:55,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:55,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 96 [2019-08-05 10:33:55,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:56,052 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 35 [2019-08-05 10:33:56,052 INFO L567 ElimStorePlain]: treesize reduction 4572, result has 1.7 percent of original size [2019-08-05 10:33:56,053 INFO L464 ElimStorePlain]: Eliminatee v_prenex_104 vanished before elimination [2019-08-05 10:33:56,053 INFO L464 ElimStorePlain]: Eliminatee v_prenex_103 vanished before elimination [2019-08-05 10:33:56,053 INFO L464 ElimStorePlain]: Eliminatee v_prenex_105 vanished before elimination [2019-08-05 10:33:56,053 INFO L464 ElimStorePlain]: Eliminatee v_prenex_107 vanished before elimination [2019-08-05 10:33:56,054 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_36 vanished before elimination [2019-08-05 10:33:56,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:33:56,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:4664, output treesize:80 [2019-08-05 10:33:56,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,584 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-08-05 10:33:56,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,872 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-08-05 10:33:56,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:56,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:56,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:56,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:56,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:33:56,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:56,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:56,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:56,910 INFO L392 ElimStorePlain]: Different costs {28=[v_prenex_110], 35=[v_prenex_111, v_prenex_108, v_prenex_109, v_SelectionSort_ar_37]} [2019-08-05 10:33:56,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:56,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 93 [2019-08-05 10:33:56,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:57,258 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 35 [2019-08-05 10:33:57,259 INFO L567 ElimStorePlain]: treesize reduction 2220, result has 3.5 percent of original size [2019-08-05 10:33:57,259 INFO L464 ElimStorePlain]: Eliminatee v_prenex_111 vanished before elimination [2019-08-05 10:33:57,259 INFO L464 ElimStorePlain]: Eliminatee v_prenex_108 vanished before elimination [2019-08-05 10:33:57,259 INFO L464 ElimStorePlain]: Eliminatee v_prenex_109 vanished before elimination [2019-08-05 10:33:57,260 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_37 vanished before elimination [2019-08-05 10:33:57,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:33:57,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:2312, output treesize:80 [2019-08-05 10:33:57,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,466 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,904 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-08-05 10:33:57,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:33:57,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,909 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:57,919 INFO L392 ElimStorePlain]: Different costs {28=[v_prenex_112], 35=[v_prenex_113, v_prenex_115, v_prenex_114, v_SelectionSort_ar_38]} [2019-08-05 10:33:57,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:57,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 95 [2019-08-05 10:33:57,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:58,173 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 35 [2019-08-05 10:33:58,173 INFO L567 ElimStorePlain]: treesize reduction 1012, result has 7.3 percent of original size [2019-08-05 10:33:58,173 INFO L464 ElimStorePlain]: Eliminatee v_prenex_113 vanished before elimination [2019-08-05 10:33:58,174 INFO L464 ElimStorePlain]: Eliminatee v_prenex_115 vanished before elimination [2019-08-05 10:33:58,174 INFO L464 ElimStorePlain]: Eliminatee v_prenex_114 vanished before elimination [2019-08-05 10:33:58,174 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_38 vanished before elimination [2019-08-05 10:33:58,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:33:58,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:1104, output treesize:80 [2019-08-05 10:33:58,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:58,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:58,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:58,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:58,560 INFO L392 ElimStorePlain]: Different costs {28=[v_prenex_117], 35=[v_prenex_116, v_prenex_118, v_SelectionSort_ar_39]} [2019-08-05 10:33:58,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:58,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 87 [2019-08-05 10:33:58,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:58,843 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2019-08-05 10:33:58,843 INFO L567 ElimStorePlain]: treesize reduction 392, result has 16.9 percent of original size [2019-08-05 10:33:58,844 INFO L464 ElimStorePlain]: Eliminatee v_prenex_116 vanished before elimination [2019-08-05 10:33:58,844 INFO L464 ElimStorePlain]: Eliminatee v_prenex_118 vanished before elimination [2019-08-05 10:33:58,844 INFO L464 ElimStorePlain]: Eliminatee v_SelectionSort_ar_39 vanished before elimination [2019-08-05 10:33:58,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:33:58,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:484, output treesize:80 [2019-08-05 10:33:58,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:59,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:33:59,279 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-08-05 10:33:59,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:33:59,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:33:59,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 82 [2019-08-05 10:33:59,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:59,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,408 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:33:59,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 82 [2019-08-05 10:33:59,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:59,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:33:59,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-08-05 10:33:59,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:192, output treesize:163 [2019-08-05 10:33:59,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:33:59,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:33:59,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 64 [2019-08-05 10:33:59,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:33:59,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:33:59,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:33:59,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:81 [2019-08-05 10:34:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:34:00,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:00,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:34:00,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:34:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:34:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:34:00,101 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 39 states. [2019-08-05 10:34:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:01,678 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-08-05 10:34:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:34:01,679 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:34:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:01,680 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:34:01,680 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:34:01,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:34:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:34:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 10:34:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:34:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-08-05 10:34:01,684 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-08-05 10:34:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:01,685 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-08-05 10:34:01,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:34:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-08-05 10:34:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:34:01,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:01,686 INFO L399 BasicCegarLoop]: trace histogram [22, 7, 7, 1, 1, 1] [2019-08-05 10:34:01,686 INFO L418 AbstractCegarLoop]: === Iteration 20 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2005875259, now seen corresponding path program 18 times [2019-08-05 10:34:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:01,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:34:01,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 244 proven. 70 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:34:01,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:01,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:34:01,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:34:01,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:34:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:34:01,906 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 17 states. [2019-08-05 10:34:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,197 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-08-05 10:34:02,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:34:02,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-08-05 10:34:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,198 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:34:02,199 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:34:02,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:34:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:34:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-08-05 10:34:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:34:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-08-05 10:34:02,204 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2019-08-05 10:34:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,204 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-08-05 10:34:02,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:34:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-08-05 10:34:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:34:02,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,205 INFO L399 BasicCegarLoop]: trace histogram [27, 8, 8, 1, 1, 1] [2019-08-05 10:34:02,205 INFO L418 AbstractCegarLoop]: === Iteration 21 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash -77779364, now seen corresponding path program 19 times [2019-08-05 10:34:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 316 proven. 63 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-08-05 10:34:02,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:02,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:34:02,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:34:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:34:02,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:34:02,997 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 16 states. [2019-08-05 10:34:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:03,410 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-08-05 10:34:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:34:03,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2019-08-05 10:34:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:03,411 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:34:03,411 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:34:03,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=436, Invalid=896, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:34:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:34:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:34:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:34:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 10:34:03,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-08-05 10:34:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:03,416 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 10:34:03,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:34:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 10:34:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:34:03,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:03,417 INFO L399 BasicCegarLoop]: trace histogram [28, 8, 8, 1, 1, 1] [2019-08-05 10:34:03,417 INFO L418 AbstractCegarLoop]: === Iteration 22 === [SelectionSortErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:03,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:03,418 INFO L82 PathProgramCache]: Analyzing trace with hash -227600072, now seen corresponding path program 20 times [2019-08-05 10:34:03,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 10:35:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-08-05 10:35:14,166 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 10:35:14,166 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:35:14,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2019-08-05 10:35:14,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2019-08-05 10:35:14,189 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures (forall i1, i2 : int :: lo <= i1 && i1 <= i2 && i2 <= hi ==> ar[i1] <= ar[i2]); is not ensure(true) [2019-08-05 10:35:14,199 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 10:35:14,199 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex05-SelectionSort.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:14 BoogieIcfgContainer [2019-08-05 10:35:14,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:14,201 INFO L168 Benchmark]: Toolchain (without parser) took 245397.11 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 107.9 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,202 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 138.4 MB. Free memory was 107.7 MB in the beginning and 105.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,203 INFO L168 Benchmark]: Boogie Preprocessor took 28.33 ms. Allocated memory is still 138.4 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,203 INFO L168 Benchmark]: RCFGBuilder took 370.16 ms. Allocated memory is still 138.4 MB. Free memory was 104.7 MB in the beginning and 92.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,204 INFO L168 Benchmark]: TraceAbstraction took 244951.71 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 92.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-08-05 10:35:14,207 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 138.4 MB. Free memory was 107.7 MB in the beginning and 105.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.33 ms. Allocated memory is still 138.4 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.16 ms. Allocated memory is still 138.4 MB. Free memory was 104.7 MB in the beginning and 92.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244951.71 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 92.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures (forall i1, i2 : int :: lo <= i1 && i1 <= i2 && i2 <= hi ==> ar[i1] <= ar[i2]); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L11-L12] requires lo <= hi; [L17] ar := a; [L19] k := lo; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND TRUE i <= hi [L25] COND FALSE !(ar[i] < ar[min]) [L26] i := i + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND TRUE k <= hi [L22] min := k; [L23] i := k + 1; [L24] COND FALSE !(i <= hi) [L30] tmp := ar[k]; [L31] ar[k] := ar[min]; [L32] ar[min] := tmp; [L34] k := k + 1; [L20] COND FALSE !(k <= hi) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 244.8s OverallTime, 22 OverallIterations, 28 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 121 SDslu, 11 SDs, 0 SdLazy, 2625 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=21, 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, 21 MinimizatonAttempts, 52 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 209.4s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 415 ConstructedInterpolants, 14 QuantifiedInterpolants, 542041 SizeOfPredicates, 91 NumberOfNonLiveVariables, 1990 ConjunctsInSsa, 560 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 1672/3149 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Completed graceful shutdown